./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:04:20,127 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:04:20,203 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:04:20,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:04:20,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:04:20,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:04:20,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:04:20,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:04:20,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:04:20,239 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:04:20,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:04:20,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:04:20,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:04:20,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:04:20,242 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:04:20,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:04:20,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:04:20,243 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:04:20,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:04:20,244 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:04:20,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:04:20,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:04:20,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:04:20,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:04:20,247 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:04:20,247 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:04:20,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:04:20,248 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:04:20,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:04:20,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:04:20,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:04:20,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:04:20,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:04:20,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:04:20,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:04:20,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:04:20,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:04:20,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:04:20,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:04:20,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:04:20,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:04:20,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:04:20,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f
[2024-11-08 18:04:20,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:04:20,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:04:20,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:04:20,651 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:04:20,651 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:04:20,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i
Unable to find full path for "g++"
[2024-11-08 18:04:23,045 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:04:23,335 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:04:23,336 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i
[2024-11-08 18:04:23,356 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/6455d82aa/8568882fab1d4ebe84e01a693d41bd87/FLAG77c729406
[2024-11-08 18:04:23,615 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/6455d82aa/8568882fab1d4ebe84e01a693d41bd87
[2024-11-08 18:04:23,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:04:23,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:04:23,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:23,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:04:23,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:04:23,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:23" (1/1) ...
[2024-11-08 18:04:23,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305b485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:23, skipping insertion in model container
[2024-11-08 18:04:23,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:23" (1/1) ...
[2024-11-08 18:04:23,695 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:04:23,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929]
[2024-11-08 18:04:24,035 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:24,049 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:04:24,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929]
[2024-11-08 18:04:24,147 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:24,188 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:04:24,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24 WrapperNode
[2024-11-08 18:04:24,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:24,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:24,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:04:24,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:04:24,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,280 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258
[2024-11-08 18:04:24,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:24,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:04:24,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:04:24,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:04:24,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:04:24,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:04:24,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:04:24,408 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:04:24,408 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:04:24,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (1/1) ...
[2024-11-08 18:04:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:04:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:24,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:04:24,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:04:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:04:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:04:24,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:04:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:04:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:04:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:04:24,694 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:04:24,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:04:25,473 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live.
[2024-11-08 18:04:25,473 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:04:25,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:04:25,503 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:04:25,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:25 BoogieIcfgContainer
[2024-11-08 18:04:25,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:04:25,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:04:25,512 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:04:25,517 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:04:25,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:04:23" (1/3) ...
[2024-11-08 18:04:25,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2338c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:25, skipping insertion in model container
[2024-11-08 18:04:25,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:24" (2/3) ...
[2024-11-08 18:04:25,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2338c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:25, skipping insertion in model container
[2024-11-08 18:04:25,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:25" (3/3) ...
[2024-11-08 18:04:25,525 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-31.i
[2024-11-08 18:04:25,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:04:25,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:04:25,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:04:25,676 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39659a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:04:25,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:04:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-08 18:04:25,711 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:25,712 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:25,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -204604097, now seen corresponding path program 1 times
[2024-11-08 18:04:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90525686]
[2024-11-08 18:04:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90525686]
[2024-11-08 18:04:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90525686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:04:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838726822]
[2024-11-08 18:04:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:26,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:04:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:04:26,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:26,642 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:04:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:26,700 INFO L93 Difference]: Finished difference Result 195 states and 335 transitions.
[2024-11-08 18:04:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:04:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172
[2024-11-08 18:04:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:26,717 INFO L225 Difference]: With dead ends: 195
[2024-11-08 18:04:26,717 INFO L226 Difference]: Without dead ends: 92
[2024-11-08 18:04:26,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:26,730 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:26,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:04:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-08 18:04:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2024-11-08 18:04:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions.
[2024-11-08 18:04:26,826 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 172
[2024-11-08 18:04:26,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:26,827 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions.
[2024-11-08 18:04:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:04:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions.
[2024-11-08 18:04:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-08 18:04:26,838 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:26,838 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:04:26,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1464419719, now seen corresponding path program 1 times
[2024-11-08 18:04:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:26,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845546789]
[2024-11-08 18:04:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845546789]
[2024-11-08 18:04:27,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845546789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:27,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:04:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719463914]
[2024-11-08 18:04:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:04:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:04:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:04:27,849 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:28,235 INFO L93 Difference]: Finished difference Result 271 states and 421 transitions.
[2024-11-08 18:04:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:04:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172
[2024-11-08 18:04:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:28,240 INFO L225 Difference]: With dead ends: 271
[2024-11-08 18:04:28,240 INFO L226 Difference]: Without dead ends: 182
[2024-11-08 18:04:28,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:04:28,243 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 91 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:28,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 382 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:04:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2024-11-08 18:04:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 151.
[2024-11-08 18:04:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-08 18:04:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions.
[2024-11-08 18:04:28,288 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 172
[2024-11-08 18:04:28,289 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:28,290 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions.
[2024-11-08 18:04:28,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions.
[2024-11-08 18:04:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-08 18:04:28,294 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:28,294 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:28,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:04:28,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1530770726, now seen corresponding path program 1 times
[2024-11-08 18:04:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785163104]
[2024-11-08 18:04:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:28,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:28,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785163104]
[2024-11-08 18:04:28,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785163104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:28,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:28,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:04:28,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541676790]
[2024-11-08 18:04:28,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:04:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:04:29,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:04:29,004 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:29,410 INFO L93 Difference]: Finished difference Result 271 states and 420 transitions.
[2024-11-08 18:04:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:04:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173
[2024-11-08 18:04:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:29,420 INFO L225 Difference]: With dead ends: 271
[2024-11-08 18:04:29,420 INFO L226 Difference]: Without dead ends: 182
[2024-11-08 18:04:29,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:04:29,426 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 89 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:29,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 384 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:04:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2024-11-08 18:04:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152.
[2024-11-08 18:04:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-08 18:04:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions.
[2024-11-08 18:04:29,480 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 173
[2024-11-08 18:04:29,481 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:29,482 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions.
[2024-11-08 18:04:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions.
[2024-11-08 18:04:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2024-11-08 18:04:29,487 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:29,487 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:04:29,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2056049412, now seen corresponding path program 1 times
[2024-11-08 18:04:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69714539]
[2024-11-08 18:04:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69714539]
[2024-11-08 18:04:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69714539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:30,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:04:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687418792]
[2024-11-08 18:04:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:30,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:04:30,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:04:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:04:30,362 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:30,681 INFO L93 Difference]: Finished difference Result 290 states and 449 transitions.
[2024-11-08 18:04:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:04:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174
[2024-11-08 18:04:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:30,689 INFO L225 Difference]: With dead ends: 290
[2024-11-08 18:04:30,689 INFO L226 Difference]: Without dead ends: 190
[2024-11-08 18:04:30,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:04:30,692 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 96 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:30,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 395 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:04:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2024-11-08 18:04:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154.
[2024-11-08 18:04:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-08 18:04:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions.
[2024-11-08 18:04:30,746 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 174
[2024-11-08 18:04:30,746 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:30,747 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions.
[2024-11-08 18:04:30,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions.
[2024-11-08 18:04:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-08 18:04:30,753 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:30,754 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:04:30,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 518743513, now seen corresponding path program 1 times
[2024-11-08 18:04:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323364690]
[2024-11-08 18:04:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323364690]
[2024-11-08 18:04:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323364690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:04:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936167175]
[2024-11-08 18:04:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:04:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:04:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:04:31,421 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:31,805 INFO L93 Difference]: Finished difference Result 410 states and 625 transitions.
[2024-11-08 18:04:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:04:31,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175
[2024-11-08 18:04:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:31,810 INFO L225 Difference]: With dead ends: 410
[2024-11-08 18:04:31,810 INFO L226 Difference]: Without dead ends: 312
[2024-11-08 18:04:31,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:31,813 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 213 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:31,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 656 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:04:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states.
[2024-11-08 18:04:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 224.
[2024-11-08 18:04:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78)
[2024-11-08 18:04:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 338 transitions.
[2024-11-08 18:04:31,861 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 338 transitions. Word has length 175
[2024-11-08 18:04:31,862 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:31,863 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 338 transitions.
[2024-11-08 18:04:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 338 transitions.
[2024-11-08 18:04:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-08 18:04:31,869 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:31,869 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:31,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:04:31,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:31,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 737598231, now seen corresponding path program 1 times
[2024-11-08 18:04:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523097156]
[2024-11-08 18:04:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523097156]
[2024-11-08 18:04:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523097156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 18:04:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562317212]
[2024-11-08 18:04:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:38,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:04:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:04:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:04:38,711 INFO L87 Difference]: Start difference. First operand 224 states and 338 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:40,196 INFO L93 Difference]: Finished difference Result 529 states and 779 transitions.
[2024-11-08 18:04:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:04:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175
[2024-11-08 18:04:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:40,203 INFO L225 Difference]: With dead ends: 529
[2024-11-08 18:04:40,204 INFO L226 Difference]: Without dead ends: 367
[2024-11-08 18:04:40,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2024-11-08 18:04:40,207 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 147 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:40,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 541 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-08 18:04:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states.
[2024-11-08 18:04:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 315.
[2024-11-08 18:04:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.3194444444444444) internal successors, (285), 218 states have internal predecessors, (285), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-08 18:04:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 469 transitions.
[2024-11-08 18:04:40,276 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 469 transitions. Word has length 175
[2024-11-08 18:04:40,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:40,277 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 469 transitions.
[2024-11-08 18:04:40,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 469 transitions.
[2024-11-08 18:04:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-08 18:04:40,280 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:40,281 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:04:40,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1417656601, now seen corresponding path program 1 times
[2024-11-08 18:04:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601778504]
[2024-11-08 18:04:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601778504]
[2024-11-08 18:04:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601778504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:41,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:41,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:04:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846925089]
[2024-11-08 18:04:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:41,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:04:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:04:41,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:04:41,266 INFO L87 Difference]: Start difference. First operand 315 states and 469 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:42,272 INFO L93 Difference]: Finished difference Result 743 states and 1105 transitions.
[2024-11-08 18:04:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:04:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175
[2024-11-08 18:04:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:42,281 INFO L225 Difference]: With dead ends: 743
[2024-11-08 18:04:42,281 INFO L226 Difference]: Without dead ends: 494
[2024-11-08 18:04:42,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156
[2024-11-08 18:04:42,283 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 308 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:42,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 660 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 18:04:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states.
[2024-11-08 18:04:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 472.
[2024-11-08 18:04:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 315 states have (on average 1.288888888888889) internal successors, (406), 319 states have internal predecessors, (406), 144 states have call successors, (144), 12 states have call predecessors, (144), 12 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144)
[2024-11-08 18:04:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 694 transitions.
[2024-11-08 18:04:42,392 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 694 transitions. Word has length 175
[2024-11-08 18:04:42,393 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:42,394 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 694 transitions.
[2024-11-08 18:04:42,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 694 transitions.
[2024-11-08 18:04:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-08 18:04:42,398 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:42,399 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:42,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 18:04:42,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:42,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 269531161, now seen corresponding path program 1 times
[2024-11-08 18:04:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373994219]
[2024-11-08 18:04:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373994219]
[2024-11-08 18:04:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373994219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:04:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988331218]
[2024-11-08 18:04:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:47,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:04:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:04:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:47,591 INFO L87 Difference]: Start difference. First operand 472 states and 694 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:48,753 INFO L93 Difference]: Finished difference Result 898 states and 1287 transitions.
[2024-11-08 18:04:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:04:48,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175
[2024-11-08 18:04:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:48,762 INFO L225 Difference]: With dead ends: 898
[2024-11-08 18:04:48,762 INFO L226 Difference]: Without dead ends: 592
[2024-11-08 18:04:48,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2024-11-08 18:04:48,765 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 137 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:48,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 612 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 18:04:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states.
[2024-11-08 18:04:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 496.
[2024-11-08 18:04:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 330 states have (on average 1.2727272727272727) internal successors, (420), 334 states have internal predecessors, (420), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:04:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 716 transitions.
[2024-11-08 18:04:48,882 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 716 transitions. Word has length 175
[2024-11-08 18:04:48,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 716 transitions.
[2024-11-08 18:04:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 716 transitions.
[2024-11-08 18:04:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:04:48,886 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:48,887 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:48,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 18:04:48,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:48,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 757511348, now seen corresponding path program 1 times
[2024-11-08 18:04:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60612903]
[2024-11-08 18:04:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60612903]
[2024-11-08 18:04:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60612903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-08 18:04:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890902496]
[2024-11-08 18:04:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:04:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:04:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:04:55,136 INFO L87 Difference]: Start difference. First operand 496 states and 716 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:57,380 INFO L93 Difference]: Finished difference Result 1078 states and 1549 transitions.
[2024-11-08 18:04:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 18:04:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:04:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:57,388 INFO L225 Difference]: With dead ends: 1078
[2024-11-08 18:04:57,388 INFO L226 Difference]: Without dead ends: 748
[2024-11-08 18:04:57,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306
[2024-11-08 18:04:57,391 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 186 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:57,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 634 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-08 18:04:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states.
[2024-11-08 18:04:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 567.
[2024-11-08 18:04:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 401 states have (on average 1.3216957605985038) internal successors, (530), 405 states have internal predecessors, (530), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:04:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 826 transitions.
[2024-11-08 18:04:57,491 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 826 transitions. Word has length 176
[2024-11-08 18:04:57,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:57,492 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 826 transitions.
[2024-11-08 18:04:57,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:04:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 826 transitions.
[2024-11-08 18:04:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:04:57,495 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:57,495 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 18:04:57,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:57,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash -390614092, now seen corresponding path program 1 times
[2024-11-08 18:04:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592503644]
[2024-11-08 18:04:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:04:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:04:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:04:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:04:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:04:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:04:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:04:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:04:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:04:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:04:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:04:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:04:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:04:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:04:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:04:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:04:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:04:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:04:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592503644]
[2024-11-08 18:04:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592503644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:59,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2024-11-08 18:04:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439628491]
[2024-11-08 18:04:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:59,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 18:04:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 18:04:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2024-11-08 18:04:59,915 INFO L87 Difference]: Start difference. First operand 567 states and 826 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:02,893 INFO L93 Difference]: Finished difference Result 1011 states and 1469 transitions.
[2024-11-08 18:05:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-08 18:05:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:05:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:02,899 INFO L225 Difference]: With dead ends: 1011
[2024-11-08 18:05:02,899 INFO L226 Difference]: Without dead ends: 632
[2024-11-08 18:05:02,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650
[2024-11-08 18:05:02,902 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 588 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:02,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1254 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2024-11-08 18:05:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states.
[2024-11-08 18:05:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 567.
[2024-11-08 18:05:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 401 states have (on average 1.319201995012469) internal successors, (529), 405 states have internal predecessors, (529), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 825 transitions.
[2024-11-08 18:05:03,001 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 825 transitions. Word has length 176
[2024-11-08 18:05:03,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 825 transitions.
[2024-11-08 18:05:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 825 transitions.
[2024-11-08 18:05:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:05:03,006 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:03,006 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:03,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 18:05:03,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:03,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 289444278, now seen corresponding path program 1 times
[2024-11-08 18:05:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994186824]
[2024-11-08 18:05:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994186824]
[2024-11-08 18:05:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994186824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-11-08 18:05:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189368745]
[2024-11-08 18:05:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-08 18:05:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-08 18:05:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210
[2024-11-08 18:05:10,887 INFO L87 Difference]: Start difference. First operand 567 states and 825 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:16,878 INFO L93 Difference]: Finished difference Result 1015 states and 1470 transitions.
[2024-11-08 18:05:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-11-08 18:05:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:05:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:16,885 INFO L225 Difference]: With dead ends: 1015
[2024-11-08 18:05:16,885 INFO L226 Difference]: Without dead ends: 643
[2024-11-08 18:05:16,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056
[2024-11-08 18:05:16,888 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 561 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:16,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1178 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time]
[2024-11-08 18:05:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states.
[2024-11-08 18:05:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 568.
[2024-11-08 18:05:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 402 states have (on average 1.3208955223880596) internal successors, (531), 406 states have internal predecessors, (531), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 827 transitions.
[2024-11-08 18:05:16,971 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 827 transitions. Word has length 176
[2024-11-08 18:05:16,972 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:16,972 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 827 transitions.
[2024-11-08 18:05:16,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 827 transitions.
[2024-11-08 18:05:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:05:16,974 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:16,975 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:16,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 18:05:16,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:16,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1015676786, now seen corresponding path program 1 times
[2024-11-08 18:05:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302632594]
[2024-11-08 18:05:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302632594]
[2024-11-08 18:05:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302632594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:20,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-08 18:05:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033192738]
[2024-11-08 18:05:20,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:05:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:05:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:05:20,502 INFO L87 Difference]: Start difference. First operand 568 states and 827 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:22,028 INFO L93 Difference]: Finished difference Result 1098 states and 1585 transitions.
[2024-11-08 18:05:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:05:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:05:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:22,035 INFO L225 Difference]: With dead ends: 1098
[2024-11-08 18:05:22,035 INFO L226 Difference]: Without dead ends: 726
[2024-11-08 18:05:22,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306
[2024-11-08 18:05:22,038 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 212 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:22,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 565 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 18:05:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states.
[2024-11-08 18:05:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 589.
[2024-11-08 18:05:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 423 states have (on average 1.3238770685579195) internal successors, (560), 427 states have internal predecessors, (560), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 856 transitions.
[2024-11-08 18:05:22,122 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 856 transitions. Word has length 176
[2024-11-08 18:05:22,122 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 856 transitions.
[2024-11-08 18:05:22,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 856 transitions.
[2024-11-08 18:05:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:05:22,126 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:22,126 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:22,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 18:05:22,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -132448654, now seen corresponding path program 1 times
[2024-11-08 18:05:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547445278]
[2024-11-08 18:05:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:23,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:23,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547445278]
[2024-11-08 18:05:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547445278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:23,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:23,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 18:05:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535377627]
[2024-11-08 18:05:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:23,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 18:05:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 18:05:23,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:05:23,656 INFO L87 Difference]: Start difference. First operand 589 states and 856 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:24,965 INFO L93 Difference]: Finished difference Result 1030 states and 1499 transitions.
[2024-11-08 18:05:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 18:05:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:05:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:24,972 INFO L225 Difference]: With dead ends: 1030
[2024-11-08 18:05:24,972 INFO L226 Difference]: Without dead ends: 638
[2024-11-08 18:05:24,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306
[2024-11-08 18:05:24,975 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 435 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:24,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 766 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 18:05:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states.
[2024-11-08 18:05:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 590.
[2024-11-08 18:05:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 424 states have (on average 1.3231132075471699) internal successors, (561), 428 states have internal predecessors, (561), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 857 transitions.
[2024-11-08 18:05:25,056 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 857 transitions. Word has length 176
[2024-11-08 18:05:25,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 857 transitions.
[2024-11-08 18:05:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 857 transitions.
[2024-11-08 18:05:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-08 18:05:25,060 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:25,060 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 18:05:25,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 547609716, now seen corresponding path program 1 times
[2024-11-08 18:05:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865816326]
[2024-11-08 18:05:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865816326]
[2024-11-08 18:05:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865816326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 18:05:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179388145]
[2024-11-08 18:05:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:05:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:05:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:05:28,909 INFO L87 Difference]: Start difference. First operand 590 states and 857 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:30,977 INFO L93 Difference]: Finished difference Result 1031 states and 1499 transitions.
[2024-11-08 18:05:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:05:30,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176
[2024-11-08 18:05:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:30,983 INFO L225 Difference]: With dead ends: 1031
[2024-11-08 18:05:30,983 INFO L226 Difference]: Without dead ends: 645
[2024-11-08 18:05:30,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:05:30,985 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 49 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:30,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 953 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2024-11-08 18:05:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states.
[2024-11-08 18:05:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 590.
[2024-11-08 18:05:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 424 states have (on average 1.3231132075471699) internal successors, (561), 428 states have internal predecessors, (561), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 857 transitions.
[2024-11-08 18:05:31,073 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 857 transitions. Word has length 176
[2024-11-08 18:05:31,073 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:31,073 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 857 transitions.
[2024-11-08 18:05:31,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 857 transitions.
[2024-11-08 18:05:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:31,076 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:31,077 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:31,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 18:05:31,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:31,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -741876324, now seen corresponding path program 1 times
[2024-11-08 18:05:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705718368]
[2024-11-08 18:05:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705718368]
[2024-11-08 18:05:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705718368] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 18:05:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830644728]
[2024-11-08 18:05:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:38,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 18:05:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:38,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 18:05:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:05:38,041 INFO L87 Difference]: Start difference. First operand 590 states and 857 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:41,722 INFO L93 Difference]: Finished difference Result 1285 states and 1852 transitions.
[2024-11-08 18:05:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:05:41,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:05:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:41,729 INFO L225 Difference]: With dead ends: 1285
[2024-11-08 18:05:41,729 INFO L226 Difference]: Without dead ends: 899
[2024-11-08 18:05:41,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210
[2024-11-08 18:05:41,734 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 231 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:41,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 911 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2024-11-08 18:05:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states.
[2024-11-08 18:05:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 647.
[2024-11-08 18:05:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 481 states have (on average 1.3534303534303533) internal successors, (651), 485 states have internal predecessors, (651), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 947 transitions.
[2024-11-08 18:05:41,827 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 947 transitions. Word has length 177
[2024-11-08 18:05:41,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 947 transitions.
[2024-11-08 18:05:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 947 transitions.
[2024-11-08 18:05:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:41,830 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:41,831 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:41,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 18:05:41,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1890001764, now seen corresponding path program 1 times
[2024-11-08 18:05:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488834664]
[2024-11-08 18:05:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:48,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488834664]
[2024-11-08 18:05:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488834664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-08 18:05:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469053922]
[2024-11-08 18:05:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:48,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-08 18:05:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-08 18:05:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2024-11-08 18:05:48,327 INFO L87 Difference]: Start difference. First operand 647 states and 947 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:51,495 INFO L93 Difference]: Finished difference Result 1182 states and 1717 transitions.
[2024-11-08 18:05:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2024-11-08 18:05:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:05:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:51,503 INFO L225 Difference]: With dead ends: 1182
[2024-11-08 18:05:51,503 INFO L226 Difference]: Without dead ends: 758
[2024-11-08 18:05:51,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=376, Invalid=1184, Unknown=0, NotChecked=0, Total=1560
[2024-11-08 18:05:51,506 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 535 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:51,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1847 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2024-11-08 18:05:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states.
[2024-11-08 18:05:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 648.
[2024-11-08 18:05:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 482 states have (on average 1.3547717842323652) internal successors, (653), 486 states have internal predecessors, (653), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 949 transitions.
[2024-11-08 18:05:51,588 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 949 transitions. Word has length 177
[2024-11-08 18:05:51,589 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:51,589 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 949 transitions.
[2024-11-08 18:05:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 949 transitions.
[2024-11-08 18:05:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:51,592 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:51,592 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:51,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 18:05:51,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:51,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1209943394, now seen corresponding path program 1 times
[2024-11-08 18:05:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:51,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901126537]
[2024-11-08 18:05:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901126537]
[2024-11-08 18:05:52,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901126537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:52,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-08 18:05:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784767447]
[2024-11-08 18:05:52,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:52,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:05:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:52,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:05:52,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:05:52,455 INFO L87 Difference]: Start difference. First operand 648 states and 949 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:53,689 INFO L93 Difference]: Finished difference Result 1163 states and 1697 transitions.
[2024-11-08 18:05:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-11-08 18:05:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:05:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:53,694 INFO L225 Difference]: With dead ends: 1163
[2024-11-08 18:05:53,695 INFO L226 Difference]: Without dead ends: 732
[2024-11-08 18:05:53,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812
[2024-11-08 18:05:53,697 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 458 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:53,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1511 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 18:05:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states.
[2024-11-08 18:05:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 648.
[2024-11-08 18:05:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 482 states have (on average 1.3526970954356847) internal successors, (652), 486 states have internal predecessors, (652), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 948 transitions.
[2024-11-08 18:05:53,780 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 948 transitions. Word has length 177
[2024-11-08 18:05:53,781 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:53,781 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 948 transitions.
[2024-11-08 18:05:53,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 948 transitions.
[2024-11-08 18:05:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:53,784 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:53,785 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:53,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 18:05:53,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -483710886, now seen corresponding path program 1 times
[2024-11-08 18:05:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161744176]
[2024-11-08 18:05:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161744176]
[2024-11-08 18:05:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161744176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2024-11-08 18:05:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115277278]
[2024-11-08 18:05:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-08 18:05:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-08 18:05:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2024-11-08 18:05:56,140 INFO L87 Difference]: Start difference. First operand 648 states and 948 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:58,480 INFO L93 Difference]: Finished difference Result 1173 states and 1704 transitions.
[2024-11-08 18:05:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2024-11-08 18:05:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:05:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:58,487 INFO L225 Difference]: With dead ends: 1173
[2024-11-08 18:05:58,488 INFO L226 Difference]: Without dead ends: 749
[2024-11-08 18:05:58,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190
[2024-11-08 18:05:58,490 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 400 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:58,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2106 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2024-11-08 18:05:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states.
[2024-11-08 18:05:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 650.
[2024-11-08 18:05:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 484 states have (on average 1.353305785123967) internal successors, (655), 488 states have internal predecessors, (655), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 951 transitions.
[2024-11-08 18:05:58,572 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 951 transitions. Word has length 177
[2024-11-08 18:05:58,573 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:58,573 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 951 transitions.
[2024-11-08 18:05:58,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 951 transitions.
[2024-11-08 18:05:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:58,575 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:58,575 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:58,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-08 18:05:58,575 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:58,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -319174498, now seen corresponding path program 1 times
[2024-11-08 18:05:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:58,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928938085]
[2024-11-08 18:05:58,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:58,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928938085]
[2024-11-08 18:05:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928938085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:58,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:05:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754034434]
[2024-11-08 18:05:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:05:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:05:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:05:58,728 INFO L87 Difference]: Start difference. First operand 650 states and 951 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:05:58,884 INFO L93 Difference]: Finished difference Result 1327 states and 1937 transitions.
[2024-11-08 18:05:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:05:58,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:05:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:05:58,893 INFO L225 Difference]: With dead ends: 1327
[2024-11-08 18:05:58,893 INFO L226 Difference]: Without dead ends: 816
[2024-11-08 18:05:58,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:05:58,896 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 122 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:05:58,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 312 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:05:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states.
[2024-11-08 18:05:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 634.
[2024-11-08 18:05:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 468 states have (on average 1.3354700854700854) internal successors, (625), 472 states have internal predecessors, (625), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:05:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 921 transitions.
[2024-11-08 18:05:58,987 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 921 transitions. Word has length 177
[2024-11-08 18:05:58,988 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:05:58,988 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 921 transitions.
[2024-11-08 18:05:58,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:05:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 921 transitions.
[2024-11-08 18:05:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:05:58,990 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:05:58,990 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:05:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-08 18:05:58,990 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:05:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:05:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 383815805, now seen corresponding path program 1 times
[2024-11-08 18:05:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:05:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078316562]
[2024-11-08 18:05:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:05:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:05:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:05:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:05:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:05:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:05:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:05:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:05:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:05:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:05:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:05:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:05:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:05:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:05:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:05:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:05:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:05:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:05:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:05:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:05:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:05:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:05:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:05:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:05:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:05:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:05:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:05:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:05:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:05:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:05:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:05:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078316562]
[2024-11-08 18:05:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078316562] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:05:59,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:05:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:05:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964637430]
[2024-11-08 18:05:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:05:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:05:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:05:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:05:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:05:59,425 INFO L87 Difference]: Start difference. First operand 634 states and 921 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:06:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:06:00,539 INFO L93 Difference]: Finished difference Result 2700 states and 3957 transitions.
[2024-11-08 18:06:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:06:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177
[2024-11-08 18:06:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:06:00,554 INFO L225 Difference]: With dead ends: 2700
[2024-11-08 18:06:00,554 INFO L226 Difference]: Without dead ends: 2274
[2024-11-08 18:06:00,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:06:00,558 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 767 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:06:00,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 756 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 18:06:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states.
[2024-11-08 18:06:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1625.
[2024-11-08 18:06:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1187 states have (on average 1.3243470935130581) internal successors, (1572), 1199 states have internal predecessors, (1572), 392 states have call successors, (392), 45 states have call predecessors, (392), 45 states have return successors, (392), 380 states have call predecessors, (392), 392 states have call successors, (392)
[2024-11-08 18:06:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2356 transitions.
[2024-11-08 18:06:00,857 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2356 transitions. Word has length 177
[2024-11-08 18:06:00,857 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:06:00,858 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2356 transitions.
[2024-11-08 18:06:00,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:06:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2356 transitions.
[2024-11-08 18:06:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:06:00,860 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:06:00,860 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:06:00,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-08 18:06:00,860 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:06:00,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:06:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2136144129, now seen corresponding path program 1 times
[2024-11-08 18:06:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:06:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150182141]
[2024-11-08 18:06:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:06:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:06:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:06:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:06:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:06:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:06:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:06:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:06:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:06:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:06:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:06:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:06:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:06:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:06:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:06:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:06:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:06:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:06:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:06:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:06:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:06:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:06:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:06:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:06:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:06:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:06:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:06:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:06:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:06:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150182141]
[2024-11-08 18:06:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150182141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:06:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:06:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 18:06:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691842996]
[2024-11-08 18:06:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:06:06,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:06:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:06:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:06:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:06:06,352 INFO L87 Difference]: Start difference. First operand 1625 states and 2356 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:06:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:06:07,893 INFO L93 Difference]: Finished difference Result 2901 states and 4216 transitions.
[2024-11-08 18:06:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:06:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177
[2024-11-08 18:06:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:06:07,907 INFO L225 Difference]: With dead ends: 2901
[2024-11-08 18:06:07,907 INFO L226 Difference]: Without dead ends: 1763
[2024-11-08 18:06:07,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:06:07,912 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 54 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:06:07,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 686 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-08 18:06:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states.
[2024-11-08 18:06:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1632.
[2024-11-08 18:06:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1194 states have (on average 1.3274706867671693) internal successors, (1585), 1206 states have internal predecessors, (1585), 392 states have call successors, (392), 45 states have call predecessors, (392), 45 states have return successors, (392), 380 states have call predecessors, (392), 392 states have call successors, (392)
[2024-11-08 18:06:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2369 transitions.
[2024-11-08 18:06:08,174 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2369 transitions. Word has length 177
[2024-11-08 18:06:08,174 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:06:08,174 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2369 transitions.
[2024-11-08 18:06:08,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:06:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2369 transitions.
[2024-11-08 18:06:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-08 18:06:08,176 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:06:08,177 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:06:08,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-08 18:06:08,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:06:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:06:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash 476882030, now seen corresponding path program 1 times
[2024-11-08 18:06:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:06:08,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692332461]
[2024-11-08 18:06:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:06:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:06:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:06:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:06:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:06:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:06:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:06:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:06:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:06:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:06:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:06:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:06:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:06:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:06:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:06:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:06:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:06:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:06:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:06:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:06:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:06:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:06:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:06:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:06:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:06:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:06:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:06:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2024-11-08 18:06:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:06:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692332461]
[2024-11-08 18:06:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692332461] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:06:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869921967]
[2024-11-08 18:06:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:06:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:06:08,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:06:08,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:06:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:09,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 18:06:09,031 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:06:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked.
[2024-11-08 18:06:09,451 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:06:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2024-11-08 18:06:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869921967] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:06:09,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 18:06:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12
[2024-11-08 18:06:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789379540]
[2024-11-08 18:06:09,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:06:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 18:06:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:06:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 18:06:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-11-08 18:06:09,858 INFO L87 Difference]: Start difference. First operand 1632 states and 2369 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43)
[2024-11-08 18:06:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:06:11,527 INFO L93 Difference]: Finished difference Result 3128 states and 4496 transitions.
[2024-11-08 18:06:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-08 18:06:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 177
[2024-11-08 18:06:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:06:11,545 INFO L225 Difference]: With dead ends: 3128
[2024-11-08 18:06:11,545 INFO L226 Difference]: Without dead ends: 1865
[2024-11-08 18:06:11,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756
[2024-11-08 18:06:11,552 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 395 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:06:11,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 865 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 18:06:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states.
[2024-11-08 18:06:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1583.
[2024-11-08 18:06:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1132 states have (on average 1.290636042402827) internal successors, (1461), 1144 states have internal predecessors, (1461), 392 states have call successors, (392), 58 states have call predecessors, (392), 58 states have return successors, (392), 380 states have call predecessors, (392), 392 states have call successors, (392)
[2024-11-08 18:06:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2245 transitions.
[2024-11-08 18:06:11,872 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2245 transitions. Word has length 177
[2024-11-08 18:06:11,873 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:06:11,873 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2245 transitions.
[2024-11-08 18:06:11,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43)
[2024-11-08 18:06:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2245 transitions.
[2024-11-08 18:06:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-08 18:06:11,875 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:06:11,876 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:06:11,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-08 18:06:12,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-11-08 18:06:12,078 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:06:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:06:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1861449013, now seen corresponding path program 1 times
[2024-11-08 18:06:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:06:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453189106]
[2024-11-08 18:06:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:06:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:06:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:06:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:06:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:06:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:06:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:06:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:06:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:06:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:06:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:06:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:06:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:06:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-08 18:06:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:06:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 18:06:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:06:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-08 18:06:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-08 18:06:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-08 18:06:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-08 18:06:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-11-08 18:06:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-08 18:06:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-11-08 18:06:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131
[2024-11-08 18:06:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137
[2024-11-08 18:06:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-08 18:06:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2024-11-08 18:06:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:06:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453189106]
[2024-11-08 18:06:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453189106] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:06:12,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146862448]
[2024-11-08 18:06:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:06:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:06:12,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:06:12,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 18:06:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:06:13,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-08 18:06:13,226 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:06:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 470 proven. 117 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked.
[2024-11-08 18:06:16,025 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:06:23,283 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod c_~var_1_10~0 256) 0) (forall ((v_z_24 Int)) (or (< v_z_24 0) (< (mod c_~var_1_15~0 65536) (+ (mod (mod (mod c_~var_1_6~0 256) v_z_24) 4294967296) 1)) (< (mod |c_ULTIMATE.start_step_~stepLocal_10~0#1| 65536) v_z_24)))) is different from false
[2024-11-08 18:06:27,448 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod c_~var_1_10~0 256) 0) (forall ((v_z_24 Int)) (let ((.cse0 (mod c_~var_1_15~0 65536))) (or (< .cse0 v_z_24) (< v_z_24 0) (< .cse0 (+ (mod (mod (mod c_~var_1_6~0 256) v_z_24) 4294967296) 1)))))) is different from false
[2024-11-08 18:06:31,927 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_z_24 Int)) (let ((.cse0 (mod c_~last_1_var_1_23~0 65536))) (or (< .cse0 (+ (mod (mod (mod c_~var_1_6~0 256) v_z_24) 4294967296) 1)) (< .cse0 v_z_24) (< v_z_24 0)))) (= (mod c_~var_1_10~0 256) 0)) is different from false
[2024-11-08 18:06:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146862448] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:06:32,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:06:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26
[2024-11-08 18:06:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373164581]
[2024-11-08 18:06:32,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:06:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-08 18:06:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:06:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-08 18:06:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=957, Unknown=3, NotChecked=198, Total=1332
[2024-11-08 18:06:32,208 INFO L87 Difference]: Start difference. First operand 1583 states and 2245 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52)
[2024-11-08 18:06:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:06:44,710 INFO L93 Difference]: Finished difference Result 2935 states and 4097 transitions.
[2024-11-08 18:06:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2024-11-08 18:06:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 178
[2024-11-08 18:06:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:06:44,723 INFO L225 Difference]: With dead ends: 2935
[2024-11-08 18:06:44,723 INFO L226 Difference]: Without dead ends: 1721
[2024-11-08 18:06:44,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=652, Invalid=4469, Unknown=3, NotChecked=426, Total=5550
[2024-11-08 18:06:44,731 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 804 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:06:44,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 994 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time]
[2024-11-08 18:06:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states.
[2024-11-08 18:06:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1459.
[2024-11-08 18:06:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1056 states have (on average 1.2840909090909092) internal successors, (1356), 1066 states have internal predecessors, (1356), 340 states have call successors, (340), 62 states have call predecessors, (340), 62 states have return successors, (340), 330 states have call predecessors, (340), 340 states have call successors, (340)
[2024-11-08 18:06:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2036 transitions.
[2024-11-08 18:06:44,985 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2036 transitions. Word has length 178
[2024-11-08 18:06:44,985 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:06:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2036 transitions.
[2024-11-08 18:06:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52)
[2024-11-08 18:06:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2036 transitions.
[2024-11-08 18:06:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-08 18:06:44,988 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:06:44,988 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:06:45,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 18:06:45,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:06:45,192 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:06:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:06:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1422401033, now seen corresponding path program 1 times
[2024-11-08 18:06:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:06:45,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429168479]
[2024-11-08 18:06:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:06:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 18:06:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007858696]
[2024-11-08 18:06:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:06:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:06:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:06:45,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:06:45,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 18:06:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:06:45,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:06:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:06:45,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:06:45,944 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:06:45,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:06:45,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 18:06:46,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-11-08 18:06:46,152 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:06:46,310 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:06:46,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:06:46 BoogieIcfgContainer
[2024-11-08 18:06:46,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:06:46,314 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:06:46,314 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:06:46,314 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:06:46,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:25" (3/4) ...
[2024-11-08 18:06:46,320 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:06:46,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:06:46,322 INFO L158 Benchmark]: Toolchain (without parser) took 142701.63ms. Allocated memory was 134.2MB in the beginning and 843.1MB in the end (delta: 708.8MB). Free memory was 91.6MB in the beginning and 391.3MB in the end (delta: -299.7MB). Peak memory consumption was 410.6MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,323 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 104.9MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:06:46,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.85ms. Allocated memory is still 134.2MB. Free memory was 91.3MB in the beginning and 72.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.12ms. Allocated memory is still 134.2MB. Free memory was 72.7MB in the beginning and 67.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,324 INFO L158 Benchmark]: Boogie Preprocessor took 125.06ms. Allocated memory is still 134.2MB. Free memory was 67.8MB in the beginning and 101.9MB in the end (delta: -34.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,324 INFO L158 Benchmark]: RCFGBuilder took 1096.40ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 101.8MB in the beginning and 113.8MB in the end (delta: -12.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,325 INFO L158 Benchmark]: TraceAbstraction took 140803.66ms. Allocated memory was 174.1MB in the beginning and 843.1MB in the end (delta: 669.0MB). Free memory was 113.0MB in the beginning and 392.3MB in the end (delta: -279.3MB). Peak memory consumption was 388.4MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,325 INFO L158 Benchmark]: Witness Printer took 7.67ms. Allocated memory is still 843.1MB. Free memory was 392.3MB in the beginning and 391.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:06:46,328 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.38ms. Allocated memory is still 104.9MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 566.85ms. Allocated memory is still 134.2MB. Free memory was 91.3MB in the beginning and 72.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 88.12ms. Allocated memory is still 134.2MB. Free memory was 72.7MB in the beginning and 67.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 125.06ms. Allocated memory is still 134.2MB. Free memory was 67.8MB in the beginning and 101.9MB in the end (delta: -34.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
* RCFGBuilder took 1096.40ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 101.8MB in the beginning and 113.8MB in the end (delta: -12.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 140803.66ms. Allocated memory was 174.1MB in the beginning and 843.1MB in the end (delta: 669.0MB). Free memory was 113.0MB in the beginning and 392.3MB in the end (delta: -279.3MB). Peak memory consumption was 388.4MB. Max. memory is 16.1GB.
* Witness Printer took 7.67ms. Allocated memory is still 843.1MB. Free memory was 392.3MB in the beginning and 391.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 98, overapproximation of bitwiseAnd at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 206.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned char var_1_1 = 200;
[L23] unsigned long int var_1_4 = 32;
[L24] unsigned char var_1_6 = 1;
[L25] unsigned char var_1_7 = 0;
[L26] unsigned char var_1_10 = 0;
[L27] unsigned char var_1_11 = 0;
[L28] unsigned char var_1_12 = 0;
[L29] unsigned char var_1_13 = 50;
[L30] unsigned long int var_1_14 = 1000000000;
[L31] unsigned short int var_1_15 = 10;
[L32] unsigned short int var_1_16 = 39011;
[L33] unsigned long int var_1_17 = 4;
[L34] signed char var_1_18 = 4;
[L35] signed char var_1_21 = 16;
[L36] signed char var_1_22 = 64;
[L37] signed long int var_1_23 = 8;
[L38] unsigned char var_1_24 = 0;
[L39] unsigned char var_1_25 = 0;
[L40] unsigned char var_1_26 = 0;
[L41] unsigned char var_1_27 = 0;
[L42] double var_1_28 = 25.5;
[L43] double var_1_29 = 255.25;
[L44] double var_1_30 = 24.7;
[L45] double var_1_31 = 31.2;
[L46] float var_1_32 = -0.2;
[L47] unsigned char var_1_33 = 10;
[L48] float var_1_34 = 24.5;
[L49] unsigned char last_1_var_1_7 = 0;
[L50] unsigned short int last_1_var_1_15 = 10;
[L51] unsigned long int last_1_var_1_17 = 4;
[L52] signed long int last_1_var_1_23 = 8;
[L53] unsigned char last_1_var_1_24 = 0;
[L54] unsigned char last_1_var_1_33 = 10;
VAL [isInitial=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0]
[L210] isInitial = 1
[L211] FCALL initially()
[L212] COND TRUE 1
[L213] CALL updateLastVariables()
[L198] last_1_var_1_7 = var_1_7
[L199] last_1_var_1_15 = var_1_15
[L200] last_1_var_1_17 = var_1_17
[L201] last_1_var_1_23 = var_1_23
[L202] last_1_var_1_24 = var_1_24
[L203] last_1_var_1_33 = var_1_33
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0]
[L213] RET updateLastVariables()
[L214] CALL updateVariables()
[L156] var_1_4 = __VERIFIER_nondet_ulong()
[L157] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L157] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L158] CALL assume_abort_if_not(var_1_4 <= 4294967295)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L158] RET assume_abort_if_not(var_1_4 <= 4294967295)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0]
[L159] CALL assume_abort_if_not(var_1_4 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=1, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=1, var_1_7=0]
[L159] RET assume_abort_if_not(var_1_4 != 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=1, var_1_7=0]
[L160] var_1_6 = __VERIFIER_nondet_uchar()
[L161] CALL assume_abort_if_not(var_1_6 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_7=0]
[L161] RET assume_abort_if_not(var_1_6 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_7=0]
[L162] CALL assume_abort_if_not(var_1_6 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L162] RET assume_abort_if_not(var_1_6 <= 254)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L163] var_1_10 = __VERIFIER_nondet_uchar()
[L164] CALL assume_abort_if_not(var_1_10 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L164] RET assume_abort_if_not(var_1_10 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L165] CALL assume_abort_if_not(var_1_10 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L165] RET assume_abort_if_not(var_1_10 <= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L166] var_1_11 = __VERIFIER_nondet_uchar()
[L167] CALL assume_abort_if_not(var_1_11 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L167] RET assume_abort_if_not(var_1_11 >= 1)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L168] CALL assume_abort_if_not(var_1_11 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L168] RET assume_abort_if_not(var_1_11 <= 1)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L169] var_1_12 = __VERIFIER_nondet_uchar()
[L170] CALL assume_abort_if_not(var_1_12 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L170] RET assume_abort_if_not(var_1_12 >= 1)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L171] CALL assume_abort_if_not(var_1_12 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L171] RET assume_abort_if_not(var_1_12 <= 1)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L172] var_1_16 = __VERIFIER_nondet_ushort()
[L173] CALL assume_abort_if_not(var_1_16 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L173] RET assume_abort_if_not(var_1_16 >= 32767)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L174] CALL assume_abort_if_not(var_1_16 <= 65534)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L174] RET assume_abort_if_not(var_1_16 <= 65534)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L175] var_1_21 = __VERIFIER_nondet_char()
[L176] CALL assume_abort_if_not(var_1_21 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L176] RET assume_abort_if_not(var_1_21 >= -1)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L177] CALL assume_abort_if_not(var_1_21 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L177] RET assume_abort_if_not(var_1_21 <= 126)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L178] var_1_22 = __VERIFIER_nondet_char()
[L179] CALL assume_abort_if_not(var_1_22 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L179] RET assume_abort_if_not(var_1_22 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L180] CALL assume_abort_if_not(var_1_22 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L180] RET assume_abort_if_not(var_1_22 <= 126)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L181] var_1_25 = __VERIFIER_nondet_uchar()
[L182] CALL assume_abort_if_not(var_1_25 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L182] RET assume_abort_if_not(var_1_25 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L183] CALL assume_abort_if_not(var_1_25 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L183] RET assume_abort_if_not(var_1_25 <= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L184] var_1_26 = __VERIFIER_nondet_uchar()
[L185] CALL assume_abort_if_not(var_1_26 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L185] RET assume_abort_if_not(var_1_26 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L186] CALL assume_abort_if_not(var_1_26 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L186] RET assume_abort_if_not(var_1_26 <= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L187] var_1_27 = __VERIFIER_nondet_uchar()
[L188] CALL assume_abort_if_not(var_1_27 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L188] RET assume_abort_if_not(var_1_27 >= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L189] CALL assume_abort_if_not(var_1_27 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L189] RET assume_abort_if_not(var_1_27 <= 0)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L190] var_1_29 = __VERIFIER_nondet_double()
[L191] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L191] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L192] var_1_30 = __VERIFIER_nondet_double()
[L193] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L193] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L194] var_1_31 = __VERIFIER_nondet_double()
[L195] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L195] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L214] RET updateVariables()
[L215] CALL step()
[L58] signed long int stepLocal_8 = last_1_var_1_33;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_8=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L59] COND FALSE !(stepLocal_8 <= ((last_1_var_1_17 / var_1_4) / var_1_16))
[L68] var_1_18 = var_1_21
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L70] COND FALSE !(! (! (last_1_var_1_7 && last_1_var_1_24)))
[L77] var_1_15 = last_1_var_1_23
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L79] var_1_14 = (var_1_6 + var_1_15)
[L80] unsigned char stepLocal_9 = last_1_var_1_7;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L81] COND TRUE ! last_1_var_1_24
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L82] COND FALSE !(stepLocal_9 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4)))))
[L85] var_1_24 = var_1_12
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L90] unsigned short int stepLocal_10 = var_1_15;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_10=8, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L91] COND FALSE !(stepLocal_10 < var_1_4)
[L98] var_1_28 = (100.4 + var_1_30)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_33=10, var_1_34=49/2, var_1_4=1, var_1_6=0, var_1_7=0]
[L100] var_1_32 = var_1_29
[L101] var_1_33 = var_1_22
[L102] var_1_34 = var_1_29
[L103] unsigned char stepLocal_7 = var_1_12;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L104] EXPR last_1_var_1_15 & 16
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L104] signed long int stepLocal_6 = last_1_var_1_15 & 16;
[L105] signed long int stepLocal_5 = last_1_var_1_15;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L106] COND FALSE !(last_1_var_1_15 < stepLocal_5)
[L117] var_1_13 = var_1_6
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L119] unsigned char stepLocal_4 = var_1_24;
[L120] unsigned long int stepLocal_3 = var_1_4;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=1, stepLocal_4=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L121] COND TRUE (var_1_24 && var_1_24) && stepLocal_4
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L122] COND FALSE !(stepLocal_3 == (- var_1_13))
[L125] var_1_7 = 0
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L130] unsigned char stepLocal_2 = var_1_13 < var_1_4;
[L131] signed long int stepLocal_1 = var_1_6 + var_1_15;
[L132] unsigned long int stepLocal_0 = var_1_13 % var_1_4;
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_0=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L133] COND FALSE !(stepLocal_0 >= var_1_15)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L138] COND TRUE stepLocal_1 > var_1_13
[L139] var_1_1 = var_1_6
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L144] COND FALSE !(var_1_14 < var_1_13)
[L147] var_1_23 = var_1_18
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L149] COND FALSE !((var_1_4 <= var_1_18) && var_1_7)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L215] RET step()
[L216] CALL, EXPR property()
[L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L206] EXPR (last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L206-L207] return ((((((((((((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))) && (var_1_14 == ((unsigned long int) (var_1_6 + var_1_15)))) && ((! (! (last_1_var_1_7 && last_1_var_1_24))) ? (last_1_var_1_7 ? (var_1_15 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_23)) ? (last_1_var_1_33) : (last_1_var_1_23))))) : (var_1_15 == ((unsigned short int) (((((var_1_16 - var_1_6)) < (10)) ? ((var_1_16 - var_1_6)) : (10)))))) : (var_1_15 == ((unsigned short int) last_1_var_1_23)))) && (((var_1_4 <= var_1_18) && var_1_7) ? ((var_1_23 == var_1_1) ? (var_1_17 == ((unsigned long int) var_1_6)) : 1) : 1)) && ((last_1_var_1_33 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) ? (last_1_var_1_24 ? (var_1_18 == ((signed char) (var_1_21 - var_1_22))) : (var_1_11 ? (var_1_18 == ((signed char) var_1_22)) : 1)) : (var_1_18 == ((signed char) var_1_21)))) && ((var_1_14 < var_1_13) ? (var_1_23 == ((signed long int) (((((var_1_14 + var_1_16)) < ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128))))) ? ((var_1_14 + var_1_16)) : ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128)))))))) : (var_1_23 == ((signed long int) var_1_18)))) && ((! last_1_var_1_24) ? ((last_1_var_1_7 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) ? (var_1_24 == ((unsigned char) (var_1_10 || ((var_1_25 || var_1_26) || var_1_27)))) : (var_1_24 == ((unsigned char) var_1_12))) : (var_1_24 == ((unsigned char) var_1_12)))) && ((var_1_15 < var_1_4) ? (var_1_24 ? (var_1_28 == ((double) ((var_1_29 - var_1_30) + var_1_31))) : (var_1_28 == ((double) (4.75 + var_1_29)))) : (var_1_28 == ((double) (100.4 + var_1_30))))) && (var_1_32 == ((float) var_1_29))) && (var_1_33 == ((unsigned char) var_1_22))) && (var_1_34 == ((float) var_1_29))
;
[L216] RET, EXPR property()
[L216] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=1, var_1_6=0, var_1_7=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 140.5s, OverallIterations: 24, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 49.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6891 SdHoareTripleChecker+Valid, 30.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6878 mSDsluCounter, 19110 SdHoareTripleChecker+Invalid, 27.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15457 mSDsCounter, 1802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9150 IncrementalHoareTripleChecker+Invalid, 10952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1802 mSolverCounterUnsat, 3653 mSDtfsCounter, 9150 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2255 GetRequests, 1865 SyntacticMatches, 3 SemanticMatches, 387 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2785 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1632occurred in iteration=21, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 2967 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 82.7s InterpolantComputationTime, 4752 NumberOfCodeBlocks, 4752 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4547 ConstructedInterpolants, 0 QuantifiedInterpolants, 20356 SizeOfPredicates, 14 NumberOfNonLiveVariables, 867 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 33470/33800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 18:06:46,559 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-08 18:06:46,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:06:49,293 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:06:49,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 18:06:49,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:06:49,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:06:49,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:06:49,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:06:49,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:06:49,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:06:49,460 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:06:49,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:06:49,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:06:49,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:06:49,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:06:49,465 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:06:49,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:06:49,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:06:49,466 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:06:49,467 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:06:49,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:06:49,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:06:49,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:06:49,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:06:49,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:06:49,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:06:49,473 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:06:49,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:06:49,474 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:06:49,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:06:49,475 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:06:49,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:06:49,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:06:49,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:06:49,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:06:49,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:06:49,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:06:49,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:06:49,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:06:49,480 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:06:49,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:06:49,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:06:49,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:06:49,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:06:49,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:06:49,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f
[2024-11-08 18:06:49,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:06:50,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:06:50,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:06:50,043 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:06:50,047 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:06:50,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i
Unable to find full path for "g++"
[2024-11-08 18:06:52,457 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:06:52,768 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:06:52,772 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i
[2024-11-08 18:06:52,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/ac7c08be4/7a886f075bbd4248a0236b41772f6c79/FLAG0282ea63d
[2024-11-08 18:06:53,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/data/ac7c08be4/7a886f075bbd4248a0236b41772f6c79
[2024-11-08 18:06:53,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:06:53,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:06:53,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:06:53,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:06:53,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:06:53,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4debc571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53, skipping insertion in model container
[2024-11-08 18:06:53,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,125 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:06:53,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929]
[2024-11-08 18:06:53,462 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:06:53,481 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:06:53,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929]
[2024-11-08 18:06:53,552 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:06:53,578 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:06:53,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53 WrapperNode
[2024-11-08 18:06:53,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:06:53,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:06:53,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:06:53,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:06:53,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,668 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200
[2024-11-08 18:06:53,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:06:53,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:06:53,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:06:53,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:06:53,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,713 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:06:53,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:06:53,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:06:53,745 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:06:53,746 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:06:53,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (1/1) ...
[2024-11-08 18:06:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:06:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:06:53,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:06:53,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:06:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:06:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:06:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:06:53,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:06:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:06:53,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:06:53,964 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:06:53,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:07:00,321 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live.
[2024-11-08 18:07:00,321 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:07:00,347 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:07:00,348 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:07:00,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:07:00 BoogieIcfgContainer
[2024-11-08 18:07:00,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:07:00,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:07:00,352 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:07:00,355 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:07:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:06:53" (1/3) ...
[2024-11-08 18:07:00,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2226f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:07:00, skipping insertion in model container
[2024-11-08 18:07:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:06:53" (2/3) ...
[2024-11-08 18:07:00,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2226f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:07:00, skipping insertion in model container
[2024-11-08 18:07:00,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:07:00" (3/3) ...
[2024-11-08 18:07:00,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-31.i
[2024-11-08 18:07:00,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:07:00,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:07:00,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:07:00,477 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25bfb7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:07:00,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:07:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:07:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:07:00,510 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:07:00,512 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:07:00,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:07:00,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:07:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash -6619331, now seen corresponding path program 1 times
[2024-11-08 18:07:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:07:00,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809237504]
[2024-11-08 18:07:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:07:00,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:00,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:07:00,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:07:00,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-08 18:07:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:07:01,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 18:07:01,409 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:07:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked.
[2024-11-08 18:07:01,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:07:01,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:07:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809237504]
[2024-11-08 18:07:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809237504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:07:01,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:07:01,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:07:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407909268]
[2024-11-08 18:07:01,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:07:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:07:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:07:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:07:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:07:01,519 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:07:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:07:01,581 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions.
[2024-11-08 18:07:01,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:07:01,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168
[2024-11-08 18:07:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:07:01,599 INFO L225 Difference]: With dead ends: 161
[2024-11-08 18:07:01,600 INFO L226 Difference]: Without dead ends: 80
[2024-11-08 18:07:01,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:07:01,615 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:07:01,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:07:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2024-11-08 18:07:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2024-11-08 18:07:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:07:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions.
[2024-11-08 18:07:01,701 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 168
[2024-11-08 18:07:01,702 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:07:01,702 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions.
[2024-11-08 18:07:01,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-08 18:07:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions.
[2024-11-08 18:07:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:07:01,711 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:07:01,712 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:07:01,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-08 18:07:01,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:01,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:07:01,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:07:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash -732583035, now seen corresponding path program 1 times
[2024-11-08 18:07:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:07:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123161491]
[2024-11-08 18:07:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:07:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:01,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:07:01,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:07:01,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-08 18:07:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:07:02,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 18:07:02,931 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:07:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:07:04,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:07:04,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:07:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123161491]
[2024-11-08 18:07:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123161491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:07:04,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:07:04,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:07:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402885117]
[2024-11-08 18:07:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:07:04,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:07:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:07:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:07:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:07:04,588 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:07:09,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:11,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:15,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:07:15,629 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions.
[2024-11-08 18:07:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:07:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168
[2024-11-08 18:07:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:07:15,685 INFO L225 Difference]: With dead ends: 276
[2024-11-08 18:07:15,685 INFO L226 Difference]: Without dead ends: 199
[2024-11-08 18:07:15,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:07:15,688 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time
[2024-11-08 18:07:15,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 387 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time]
[2024-11-08 18:07:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2024-11-08 18:07:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148.
[2024-11-08 18:07:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-08 18:07:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions.
[2024-11-08 18:07:15,732 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 168
[2024-11-08 18:07:15,733 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:07:15,733 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions.
[2024-11-08 18:07:15,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:07:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions.
[2024-11-08 18:07:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-08 18:07:15,743 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:07:15,744 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:07:15,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-08 18:07:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:15,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:07:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:07:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1080314290, now seen corresponding path program 1 times
[2024-11-08 18:07:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:07:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311375783]
[2024-11-08 18:07:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:07:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:07:15,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:07:15,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 18:07:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:07:16,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 18:07:16,651 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:07:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:07:18,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:07:18,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:07:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311375783]
[2024-11-08 18:07:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311375783] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:07:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:07:18,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:07:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077743729]
[2024-11-08 18:07:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:07:18,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:07:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:07:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:07:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:07:18,424 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:07:22,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:24,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:28,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:31,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:36,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:38,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:07:39,272 INFO L93 Difference]: Finished difference Result 538 states and 835 transitions.
[2024-11-08 18:07:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:07:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169
[2024-11-08 18:07:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:07:39,279 INFO L225 Difference]: With dead ends: 538
[2024-11-08 18:07:39,280 INFO L226 Difference]: Without dead ends: 393
[2024-11-08 18:07:39,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:07:39,284 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 192 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time
[2024-11-08 18:07:39,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 597 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 20.6s Time]
[2024-11-08 18:07:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2024-11-08 18:07:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 262.
[2024-11-08 18:07:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 153 states have (on average 1.2679738562091503) internal successors, (194), 153 states have internal predecessors, (194), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:07:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 402 transitions.
[2024-11-08 18:07:39,431 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 402 transitions. Word has length 169
[2024-11-08 18:07:39,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:07:39,432 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 402 transitions.
[2024-11-08 18:07:39,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:07:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 402 transitions.
[2024-11-08 18:07:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-08 18:07:39,440 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:07:39,440 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:07:39,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-08 18:07:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:39,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:07:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:07:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash 59245936, now seen corresponding path program 1 times
[2024-11-08 18:07:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:07:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603071452]
[2024-11-08 18:07:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:07:39,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:07:39,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:07:39,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:07:39,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-08 18:07:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:07:40,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 18:07:40,343 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:07:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 637 proven. 90 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked.
[2024-11-08 18:07:43,029 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:07:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2024-11-08 18:07:44,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:07:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603071452]
[2024-11-08 18:07:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603071452] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:07:44,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:07:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14
[2024-11-08 18:07:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436415772]
[2024-11-08 18:07:44,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:07:44,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-08 18:07:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:07:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-08 18:07:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182
[2024-11-08 18:07:44,419 INFO L87 Difference]: Start difference. First operand 262 states and 402 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43)
[2024-11-08 18:07:47,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:52,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:56,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:07:59,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:03,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:07,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:08:09,135 INFO L93 Difference]: Finished difference Result 774 states and 1137 transitions.
[2024-11-08 18:08:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2024-11-08 18:08:09,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 169
[2024-11-08 18:08:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:08:09,143 INFO L225 Difference]: With dead ends: 774
[2024-11-08 18:08:09,143 INFO L226 Difference]: Without dead ends: 563
[2024-11-08 18:08:09,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406
[2024-11-08 18:08:09,148 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 379 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 219 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:08:09,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 668 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 628 Invalid, 3 Unknown, 0 Unchecked, 23.0s Time]
[2024-11-08 18:08:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states.
[2024-11-08 18:08:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 303.
[2024-11-08 18:08:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 186 states have (on average 1.2419354838709677) internal successors, (231), 186 states have internal predecessors, (231), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:08:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 439 transitions.
[2024-11-08 18:08:09,242 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 439 transitions. Word has length 169
[2024-11-08 18:08:09,244 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:08:09,246 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 439 transitions.
[2024-11-08 18:08:09,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43)
[2024-11-08 18:08:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 439 transitions.
[2024-11-08 18:08:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:08:09,252 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:08:09,252 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:08:09,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-08 18:08:09,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:09,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:08:09,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:08:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 659025480, now seen corresponding path program 1 times
[2024-11-08 18:08:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:08:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458241373]
[2024-11-08 18:08:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:08:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:09,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:08:09,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:08:09,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-08 18:08:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:08:10,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 18:08:10,210 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:08:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked.
[2024-11-08 18:08:11,852 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:08:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2024-11-08 18:08:13,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:08:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458241373]
[2024-11-08 18:08:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458241373] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:08:13,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:08:13,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11
[2024-11-08 18:08:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578399820]
[2024-11-08 18:08:13,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:08:13,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:08:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:08:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:08:13,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:08:13,454 INFO L87 Difference]: Start difference. First operand 303 states and 439 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50)
[2024-11-08 18:08:19,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 18:08:23,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 18:08:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:08:23,616 INFO L93 Difference]: Finished difference Result 615 states and 874 transitions.
[2024-11-08 18:08:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 18:08:23,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 170
[2024-11-08 18:08:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:08:23,666 INFO L225 Difference]: With dead ends: 615
[2024-11-08 18:08:23,666 INFO L226 Difference]: Without dead ends: 371
[2024-11-08 18:08:23,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2024-11-08 18:08:23,669 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 181 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:08:23,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 365 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time]
[2024-11-08 18:08:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2024-11-08 18:08:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 326.
[2024-11-08 18:08:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 205 states have internal predecessors, (253), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:08:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 461 transitions.
[2024-11-08 18:08:23,735 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 461 transitions. Word has length 170
[2024-11-08 18:08:23,736 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:08:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 461 transitions.
[2024-11-08 18:08:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50)
[2024-11-08 18:08:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 461 transitions.
[2024-11-08 18:08:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:08:23,739 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:08:23,740 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:08:23,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-08 18:08:23,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:23,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:08:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:08:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 265998470, now seen corresponding path program 1 times
[2024-11-08 18:08:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:08:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943474155]
[2024-11-08 18:08:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:08:23,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:08:23,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:08:23,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-08 18:08:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:08:24,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 18:08:24,571 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:08:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:08:26,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:08:26,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:08:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943474155]
[2024-11-08 18:08:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943474155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:08:26,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:08:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:08:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757285780]
[2024-11-08 18:08:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:08:26,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:08:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:08:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:08:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:08:26,269 INFO L87 Difference]: Start difference. First operand 326 states and 461 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:08:31,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:34,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:39,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:41,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:08:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:08:41,843 INFO L93 Difference]: Finished difference Result 765 states and 1084 transitions.
[2024-11-08 18:08:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:08:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-08 18:08:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:08:41,849 INFO L225 Difference]: With dead ends: 765
[2024-11-08 18:08:41,849 INFO L226 Difference]: Without dead ends: 502
[2024-11-08 18:08:41,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2024-11-08 18:08:41,852 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 241 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 166 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:08:41,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 764 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time]
[2024-11-08 18:08:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states.
[2024-11-08 18:08:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 358.
[2024-11-08 18:08:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 237 states have internal predecessors, (300), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:08:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 508 transitions.
[2024-11-08 18:08:41,943 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 508 transitions. Word has length 170
[2024-11-08 18:08:41,944 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:08:41,944 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 508 transitions.
[2024-11-08 18:08:41,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:08:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 508 transitions.
[2024-11-08 18:08:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:08:41,948 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:08:41,948 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:08:41,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2024-11-08 18:08:42,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:42,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:08:42,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:08:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash 323256772, now seen corresponding path program 1 times
[2024-11-08 18:08:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:08:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022698733]
[2024-11-08 18:08:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:08:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:08:42,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:08:42,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-08 18:08:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:08:42,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 18:08:42,862 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:08:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked.
[2024-11-08 18:08:47,742 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:08:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-08 18:08:50,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:08:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022698733]
[2024-11-08 18:08:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022698733] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:08:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 18:08:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15
[2024-11-08 18:08:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600889392]
[2024-11-08 18:08:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:08:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:08:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:08:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:08:50,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2024-11-08 18:08:50,655 INFO L87 Difference]: Start difference. First operand 358 states and 508 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:08:55,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]
[2024-11-08 18:08:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:08:56,437 INFO L93 Difference]: Finished difference Result 654 states and 930 transitions.
[2024-11-08 18:08:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:08:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-08 18:08:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:08:56,445 INFO L225 Difference]: With dead ends: 654
[2024-11-08 18:08:56,449 INFO L226 Difference]: Without dead ends: 390
[2024-11-08 18:08:56,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272
[2024-11-08 18:08:56,454 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:08:56,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 323 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time]
[2024-11-08 18:08:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states.
[2024-11-08 18:08:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 367.
[2024-11-08 18:08:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 246 states have (on average 1.2682926829268293) internal successors, (312), 246 states have internal predecessors, (312), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:08:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 520 transitions.
[2024-11-08 18:08:56,525 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 520 transitions. Word has length 170
[2024-11-08 18:08:56,525 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:08:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 520 transitions.
[2024-11-08 18:08:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-08 18:08:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 520 transitions.
[2024-11-08 18:08:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:08:56,531 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:08:56,531 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:08:56,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2024-11-08 18:08:56,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:56,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:08:56,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:08:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2098264134, now seen corresponding path program 1 times
[2024-11-08 18:08:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:08:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830407459]
[2024-11-08 18:08:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:08:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:08:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:08:56,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:08:56,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-11-08 18:08:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:08:57,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-08 18:08:57,717 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:09:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 655 proven. 153 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked.
[2024-11-08 18:09:05,534 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:09:22,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:09:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830407459]
[2024-11-08 18:09:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830407459] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:09:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164031542]
[2024-11-08 18:09:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:09:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:09:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:09:22,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:09:22,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-08 18:09:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:09:23,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 18:09:23,236 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:09:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked.
[2024-11-08 18:09:30,217 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:09:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164031542] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:09:38,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:09:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 21
[2024-11-08 18:09:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536273954]
[2024-11-08 18:09:38,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:09:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-11-08 18:09:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:09:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-08 18:09:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930
[2024-11-08 18:09:38,245 INFO L87 Difference]: Start difference. First operand 367 states and 520 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 4 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43)
[2024-11-08 18:09:49,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:09:57,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:01,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:04,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:07,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:11,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:13,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:10:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:10:13,605 INFO L93 Difference]: Finished difference Result 671 states and 942 transitions.
[2024-11-08 18:10:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-11-08 18:10:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 4 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 170
[2024-11-08 18:10:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:10:13,609 INFO L225 Difference]: With dead ends: 671
[2024-11-08 18:10:13,610 INFO L226 Difference]: Without dead ends: 400
[2024-11-08 18:10:13,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=517, Invalid=2453, Unknown=0, NotChecked=0, Total=2970
[2024-11-08 18:10:13,613 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 307 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:10:13,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 935 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 28.3s Time]
[2024-11-08 18:10:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2024-11-08 18:10:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 366.
[2024-11-08 18:10:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 245 states have internal predecessors, (310), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-08 18:10:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 518 transitions.
[2024-11-08 18:10:13,686 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 518 transitions. Word has length 170
[2024-11-08 18:10:13,686 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:10:13,687 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 518 transitions.
[2024-11-08 18:10:13,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 4 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43)
[2024-11-08 18:10:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 518 transitions.
[2024-11-08 18:10:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:10:13,692 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:10:13,692 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:10:13,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2024-11-08 18:10:13,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-08 18:10:14,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:10:14,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:10:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:10:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -109067580, now seen corresponding path program 1 times
[2024-11-08 18:10:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:10:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072444526]
[2024-11-08 18:10:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:10:14,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:10:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:10:14,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:10:14,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f03a3f-0888-436b-b28a-ae813cf0cb3f/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-11-08 18:10:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:10:14,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 47 conjuncts are in the unsatisfiable core
[2024-11-08 18:10:14,798 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:11:04,903 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:12:00,783 WARN L286 SmtUtils]: Spent 20.59s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:12:59,581 WARN L286 SmtUtils]: Spent 22.74s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:13:56,049 WARN L286 SmtUtils]: Spent 21.90s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:15:11,227 WARN L286 SmtUtils]: Spent 21.37s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:16:18,055 WARN L286 SmtUtils]: Spent 20.30s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:17:54,482 WARN L286 SmtUtils]: Spent 26.70s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)