./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya --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 64bit --witnessprinter.graph.data.programhash c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:47:36,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:47:36,392 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:47:36,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:47:36,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:47:36,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:47:36,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:47:36,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:47:36,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:47:36,424 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:47:36,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:47:36,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:47:36,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:47:36,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:47:36,427 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:47:36,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:47:36,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:47:36,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:47:36,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:47:36,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:47:36,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:47:36,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:47:36,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:47:36,431 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:47:36,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:47:36,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:47:36,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:47:36,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:47:36,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:47:36,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:47:36,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:47:36,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:47:36,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:47:36,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:47:36,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:47:36,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:47:36,436 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:47:36,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:47:36,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:47:36,437 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_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa [2023-11-29 05:47:36,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:47:36,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:47:36,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:47:36,712 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:47:36,713 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:47:36,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2023-11-29 05:47:39,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:47:39,711 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:47:39,712 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2023-11-29 05:47:39,721 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/c1bf1577a/621f4c2f729d419386067111d5ed1409/FLAGa0deeed80 [2023-11-29 05:47:39,733 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/c1bf1577a/621f4c2f729d419386067111d5ed1409 [2023-11-29 05:47:39,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:47:39,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:47:39,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:47:39,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:47:39,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:47:39,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:47:39" (1/1) ... [2023-11-29 05:47:39,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e07453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:39, skipping insertion in model container [2023-11-29 05:47:39,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:47:39" (1/1) ... [2023-11-29 05:47:39,769 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:47:39,917 WARN L240 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_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2023-11-29 05:47:39,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:47:39,964 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:47:39,974 WARN L240 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_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2023-11-29 05:47:39,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:47:40,008 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:47:40,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40 WrapperNode [2023-11-29 05:47:40,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:47:40,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:47:40,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:47:40,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:47:40,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,064 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 156 [2023-11-29 05:47:40,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:47:40,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:47:40,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:47:40,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:47:40,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,113 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]. [2023-11-29 05:47:40,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:47:40,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:47:40,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:47:40,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:47:40,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (1/1) ... [2023-11-29 05:47:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:47:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:40,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:47:40,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:47:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:47:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:47:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:47:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:47:40,292 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:47:40,294 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:47:40,576 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:47:40,602 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:47:40,602 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:47:40,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:47:40 BoogieIcfgContainer [2023-11-29 05:47:40,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:47:40,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:47:40,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:47:40,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:47:40,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:47:39" (1/3) ... [2023-11-29 05:47:40,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447646fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:47:40, skipping insertion in model container [2023-11-29 05:47:40,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:47:40" (2/3) ... [2023-11-29 05:47:40,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447646fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:47:40, skipping insertion in model container [2023-11-29 05:47:40,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:47:40" (3/3) ... [2023-11-29 05:47:40,612 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2023-11-29 05:47:40,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:47:40,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:47:40,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:47:40,692 INFO L357 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, mHoare=true, 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;@1fef1754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:47:40,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:47:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 05:47:40,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:40,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:40,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:40,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1162187761, now seen corresponding path program 1 times [2023-11-29 05:47:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126326919] [2023-11-29 05:47:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:41,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126326919] [2023-11-29 05:47:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126326919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:47:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12304489] [2023-11-29 05:47:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:41,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:47:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:47:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:47:41,136 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:41,174 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-11-29 05:47:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:47:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 05:47:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:41,184 INFO L225 Difference]: With dead ends: 57 [2023-11-29 05:47:41,185 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 05:47:41,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:47:41,191 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:41,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:47:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 05:47:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 05:47:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2023-11-29 05:47:41,224 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 14 [2023-11-29 05:47:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:41,224 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2023-11-29 05:47:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2023-11-29 05:47:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:47:41,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:41,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:41,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:47:41,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:41,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1666357215, now seen corresponding path program 1 times [2023-11-29 05:47:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:41,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048450722] [2023-11-29 05:47:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048450722] [2023-11-29 05:47:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048450722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:41,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:41,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:47:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387746127] [2023-11-29 05:47:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:41,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:47:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:47:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:47:41,354 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:41,382 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2023-11-29 05:47:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:47:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:47:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:41,384 INFO L225 Difference]: With dead ends: 60 [2023-11-29 05:47:41,384 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 05:47:41,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:47:41,387 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:41,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:47:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 05:47:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-29 05:47:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2023-11-29 05:47:41,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 15 [2023-11-29 05:47:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:41,394 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-11-29 05:47:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2023-11-29 05:47:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 05:47:41,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:41,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:41,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:47:41,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:41,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -327898519, now seen corresponding path program 1 times [2023-11-29 05:47:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281907366] [2023-11-29 05:47:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281907366] [2023-11-29 05:47:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281907366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:41,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:47:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85294345] [2023-11-29 05:47:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:47:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:47:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:47:41,711 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:41,989 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2023-11-29 05:47:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:47:41,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 05:47:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:41,991 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:47:41,992 INFO L226 Difference]: Without dead ends: 58 [2023-11-29 05:47:41,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:47:41,994 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 209 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:41,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 118 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:47:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-29 05:47:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2023-11-29 05:47:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-11-29 05:47:42,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 16 [2023-11-29 05:47:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:42,002 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-11-29 05:47:42,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-11-29 05:47:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:47:42,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:42,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:42,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:47:42,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:42,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 892453359, now seen corresponding path program 1 times [2023-11-29 05:47:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663545716] [2023-11-29 05:47:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663545716] [2023-11-29 05:47:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663545716] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:42,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070139066] [2023-11-29 05:47:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:42,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:42,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:47:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:42,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 05:47:42,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:42,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070139066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:43,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:43,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 29 [2023-11-29 05:47:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927503935] [2023-11-29 05:47:43,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:43,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 05:47:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 05:47:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:47:43,570 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:45,125 INFO L93 Difference]: Finished difference Result 216 states and 312 transitions. [2023-11-29 05:47:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-29 05:47:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 05:47:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:45,128 INFO L225 Difference]: With dead ends: 216 [2023-11-29 05:47:45,129 INFO L226 Difference]: Without dead ends: 189 [2023-11-29 05:47:45,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1137, Invalid=4265, Unknown=0, NotChecked=0, Total=5402 [2023-11-29 05:47:45,133 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1083 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:45,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 502 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:47:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-29 05:47:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 69. [2023-11-29 05:47:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 68 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2023-11-29 05:47:45,145 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 31 [2023-11-29 05:47:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:45,146 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2023-11-29 05:47:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2023-11-29 05:47:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:47:45,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:45,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:45,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:47:45,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:45,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:45,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1831793815, now seen corresponding path program 1 times [2023-11-29 05:47:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762120908] [2023-11-29 05:47:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762120908] [2023-11-29 05:47:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762120908] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905711031] [2023-11-29 05:47:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:45,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:45,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:45,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:45,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:47:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:45,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:47:45,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:46,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905711031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:46,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 24 [2023-11-29 05:47:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894158962] [2023-11-29 05:47:46,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:46,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 05:47:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 05:47:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:47:46,418 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:47,071 INFO L93 Difference]: Finished difference Result 269 states and 374 transitions. [2023-11-29 05:47:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:47:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 05:47:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:47,074 INFO L225 Difference]: With dead ends: 269 [2023-11-29 05:47:47,075 INFO L226 Difference]: Without dead ends: 207 [2023-11-29 05:47:47,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 05:47:47,077 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 223 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:47,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 719 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:47:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-29 05:47:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2023-11-29 05:47:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 68 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2023-11-29 05:47:47,089 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 33 [2023-11-29 05:47:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:47,089 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2023-11-29 05:47:47,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2023-11-29 05:47:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:47:47,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:47,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:47,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:47:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:47,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:47,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1790705825, now seen corresponding path program 1 times [2023-11-29 05:47:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382660580] [2023-11-29 05:47:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382660580] [2023-11-29 05:47:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382660580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:47,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565526229] [2023-11-29 05:47:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:47,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:47:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:47,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:47:47,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:47:47,743 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:47,914 INFO L93 Difference]: Finished difference Result 180 states and 252 transitions. [2023-11-29 05:47:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:47:47,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 05:47:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:47,916 INFO L225 Difference]: With dead ends: 180 [2023-11-29 05:47:47,916 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 05:47:47,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:47:47,918 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 139 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:47,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 103 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:47:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 05:47:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2023-11-29 05:47:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2023-11-29 05:47:47,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 34 [2023-11-29 05:47:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:47,928 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2023-11-29 05:47:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2023-11-29 05:47:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:47:47,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:47,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:47,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:47:47,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:47,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 101762083, now seen corresponding path program 1 times [2023-11-29 05:47:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368369377] [2023-11-29 05:47:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368369377] [2023-11-29 05:47:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368369377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052142084] [2023-11-29 05:47:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:48,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:48,257 INFO L87 Difference]: Start difference. First operand 90 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:48,404 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2023-11-29 05:47:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:47:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 05:47:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:48,406 INFO L225 Difference]: With dead ends: 173 [2023-11-29 05:47:48,406 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 05:47:48,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:47:48,408 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:48,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 93 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:47:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 05:47:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2023-11-29 05:47:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2023-11-29 05:47:48,416 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 34 [2023-11-29 05:47:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:48,417 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2023-11-29 05:47:48,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2023-11-29 05:47:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:47:48,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:48,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:48,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:47:48,419 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:47:48,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash -485043931, now seen corresponding path program 1 times [2023-11-29 05:47:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235758743] [2023-11-29 05:47:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235758743] [2023-11-29 05:47:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235758743] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153624286] [2023-11-29 05:47:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:49,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:49,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:49,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:49,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:47:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:49,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 05:47:49,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:49,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153624286] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:52,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 35 [2023-11-29 05:47:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552966996] [2023-11-29 05:47:52,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:52,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 05:47:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 05:47:52,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 05:47:52,036 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:00,792 INFO L93 Difference]: Finished difference Result 507 states and 687 transitions. [2023-11-29 05:48:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-11-29 05:48:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 05:48:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:00,794 INFO L225 Difference]: With dead ends: 507 [2023-11-29 05:48:00,794 INFO L226 Difference]: Without dead ends: 439 [2023-11-29 05:48:00,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6468 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3427, Invalid=15479, Unknown=0, NotChecked=0, Total=18906 [2023-11-29 05:48:00,800 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2568 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:00,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 265 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:48:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-29 05:48:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 136. [2023-11-29 05:48:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2023-11-29 05:48:00,816 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 34 [2023-11-29 05:48:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2023-11-29 05:48:00,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2023-11-29 05:48:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:48:00,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:00,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:00,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:48:01,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:01,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:01,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1297443337, now seen corresponding path program 1 times [2023-11-29 05:48:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521068663] [2023-11-29 05:48:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 05:48:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521068663] [2023-11-29 05:48:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521068663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:01,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:48:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583596038] [2023-11-29 05:48:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:01,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:48:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:48:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:48:01,289 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:01,343 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2023-11-29 05:48:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:48:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 05:48:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:01,344 INFO L225 Difference]: With dead ends: 235 [2023-11-29 05:48:01,344 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 05:48:01,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:48:01,346 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:01,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:48:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 05:48:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2023-11-29 05:48:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2023-11-29 05:48:01,355 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 50 [2023-11-29 05:48:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:01,355 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2023-11-29 05:48:01,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2023-11-29 05:48:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:48:01,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:01,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:01,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:48:01,357 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:01,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash 240372749, now seen corresponding path program 1 times [2023-11-29 05:48:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489487917] [2023-11-29 05:48:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489487917] [2023-11-29 05:48:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489487917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573547241] [2023-11-29 05:48:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:01,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:48:01,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:48:01,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:48:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:01,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 05:48:01,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:02,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:48:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573547241] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:48:03,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:48:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 34 [2023-11-29 05:48:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061926135] [2023-11-29 05:48:03,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:48:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 05:48:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 05:48:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 05:48:03,676 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:09,371 INFO L93 Difference]: Finished difference Result 478 states and 622 transitions. [2023-11-29 05:48:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-11-29 05:48:09,372 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 05:48:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:09,374 INFO L225 Difference]: With dead ends: 478 [2023-11-29 05:48:09,374 INFO L226 Difference]: Without dead ends: 420 [2023-11-29 05:48:09,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2933, Invalid=10873, Unknown=0, NotChecked=0, Total=13806 [2023-11-29 05:48:09,378 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1397 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:09,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 219 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:48:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-11-29 05:48:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 187. [2023-11-29 05:48:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.3333333333333333) internal successors, (248), 186 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2023-11-29 05:48:09,392 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 51 [2023-11-29 05:48:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:09,393 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2023-11-29 05:48:09,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2023-11-29 05:48:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:48:09,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:09,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:09,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:48:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:09,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:09,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash -346373683, now seen corresponding path program 1 times [2023-11-29 05:48:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:09,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148577569] [2023-11-29 05:48:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148577569] [2023-11-29 05:48:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148577569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613309701] [2023-11-29 05:48:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:10,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:48:10,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:48:10,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:48:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:10,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:48:10,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:48:10,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:48:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:48:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613309701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:48:11,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:48:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2023-11-29 05:48:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991554316] [2023-11-29 05:48:11,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:48:11,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 05:48:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 05:48:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:48:11,231 INFO L87 Difference]: Start difference. First operand 187 states and 248 transitions. Second operand has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 28 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:12,893 INFO L93 Difference]: Finished difference Result 586 states and 759 transitions. [2023-11-29 05:48:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 05:48:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 28 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 05:48:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:12,895 INFO L225 Difference]: With dead ends: 586 [2023-11-29 05:48:12,896 INFO L226 Difference]: Without dead ends: 421 [2023-11-29 05:48:12,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=989, Invalid=4413, Unknown=0, NotChecked=0, Total=5402 [2023-11-29 05:48:12,898 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 638 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:12,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 192 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:48:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-29 05:48:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 202. [2023-11-29 05:48:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 201 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 258 transitions. [2023-11-29 05:48:12,923 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 258 transitions. Word has length 51 [2023-11-29 05:48:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:12,923 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 258 transitions. [2023-11-29 05:48:12,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 28 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 258 transitions. [2023-11-29 05:48:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 05:48:12,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:12,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:12,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:48:13,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:48:13,131 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:13,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1274828299, now seen corresponding path program 1 times [2023-11-29 05:48:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:13,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386263061] [2023-11-29 05:48:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:13,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:48:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386263061] [2023-11-29 05:48:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386263061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:48:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462795940] [2023-11-29 05:48:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:48:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:48:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:48:13,471 INFO L87 Difference]: Start difference. First operand 202 states and 258 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:13,606 INFO L93 Difference]: Finished difference Result 401 states and 509 transitions. [2023-11-29 05:48:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:48:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-29 05:48:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:13,608 INFO L225 Difference]: With dead ends: 401 [2023-11-29 05:48:13,609 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 05:48:13,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:48:13,610 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:13,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 204 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:48:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 05:48:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2023-11-29 05:48:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 209 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 266 transitions. [2023-11-29 05:48:13,633 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 266 transitions. Word has length 52 [2023-11-29 05:48:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:13,633 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 266 transitions. [2023-11-29 05:48:13,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 266 transitions. [2023-11-29 05:48:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 05:48:13,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:13,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:13,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:48:13,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:13,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -381341961, now seen corresponding path program 1 times [2023-11-29 05:48:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938861887] [2023-11-29 05:48:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938861887] [2023-11-29 05:48:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938861887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295878461] [2023-11-29 05:48:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:48:14,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:48:14,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:48:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:14,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:48:14,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:48:15,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:48:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-29 05:48:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295878461] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:15,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:48:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16, 7] total 24 [2023-11-29 05:48:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766922875] [2023-11-29 05:48:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:15,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:48:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:48:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:48:15,127 INFO L87 Difference]: Start difference. First operand 210 states and 266 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:15,163 INFO L93 Difference]: Finished difference Result 380 states and 489 transitions. [2023-11-29 05:48:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:48:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-29 05:48:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:15,165 INFO L225 Difference]: With dead ends: 380 [2023-11-29 05:48:15,166 INFO L226 Difference]: Without dead ends: 236 [2023-11-29 05:48:15,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:48:15,167 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 51 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:15,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 120 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:48:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-29 05:48:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2023-11-29 05:48:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 169 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2023-11-29 05:48:15,181 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 52 [2023-11-29 05:48:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:15,182 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2023-11-29 05:48:15,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2023-11-29 05:48:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:48:15,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:15,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:15,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:48:15,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:15,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:48:15,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1454071427, now seen corresponding path program 1 times [2023-11-29 05:48:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:15,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300869303] [2023-11-29 05:48:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300869303] [2023-11-29 05:48:16,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300869303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683769808] [2023-11-29 05:48:16,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:16,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:48:16,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:48:16,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:48:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:16,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 05:48:16,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:18,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:49:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:49:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683769808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:49:36,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:49:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 23] total 55 [2023-11-29 05:49:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143042461] [2023-11-29 05:49:36,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:49:36,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 05:49:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:36,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 05:49:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2822, Unknown=0, NotChecked=0, Total=3080 [2023-11-29 05:49:36,684 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand has 56 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 55 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:54:58,044 INFO L93 Difference]: Finished difference Result 859 states and 1076 transitions. [2023-11-29 05:54:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2023-11-29 05:54:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 55 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 05:54:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:54:58,048 INFO L225 Difference]: With dead ends: 859 [2023-11-29 05:54:58,048 INFO L226 Difference]: Without dead ends: 744 [2023-11-29 05:54:58,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18408 ImplicationChecksByTransitivity, 329.6s TimeCoverageRelationStatistics Valid=8150, Invalid=40468, Unknown=2, NotChecked=0, Total=48620 [2023-11-29 05:54:58,054 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5111 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5111 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:54:58,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5111 Valid, 355 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-29 05:54:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-11-29 05:54:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 239. [2023-11-29 05:54:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.2436974789915967) internal successors, (296), 238 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2023-11-29 05:54:58,078 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 53 [2023-11-29 05:54:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:54:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2023-11-29 05:54:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 55 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2023-11-29 05:54:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:54:58,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:58,080 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:58,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:54:58,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:54:58,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:58,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1489159627, now seen corresponding path program 1 times [2023-11-29 05:54:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290371344] [2023-11-29 05:54:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:54:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290371344] [2023-11-29 05:54:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290371344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:54:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655146532] [2023-11-29 05:54:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:54:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:59,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:54:59,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:54:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:59,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-29 05:54:59,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:55:01,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:08,303 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:57:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 61 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655146532] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:10,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:57:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 24] total 55 [2023-11-29 05:57:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362816213] [2023-11-29 05:57:10,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:10,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 05:57:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 05:57:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=2625, Unknown=9, NotChecked=0, Total=3080 [2023-11-29 05:57:10,414 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand has 56 states, 56 states have (on average 3.1607142857142856) internal successors, (177), 55 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:15,283 INFO L93 Difference]: Finished difference Result 676 states and 853 transitions. [2023-11-29 05:57:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 05:57:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.1607142857142856) internal successors, (177), 55 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2023-11-29 05:57:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:15,286 INFO L225 Difference]: With dead ends: 676 [2023-11-29 05:57:15,286 INFO L226 Difference]: Without dead ends: 516 [2023-11-29 05:57:15,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2510 ImplicationChecksByTransitivity, 67.3s TimeCoverageRelationStatistics Valid=2101, Invalid=6632, Unknown=9, NotChecked=0, Total=8742 [2023-11-29 05:57:15,288 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1604 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:15,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 228 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 05:57:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-11-29 05:57:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 299. [2023-11-29 05:57:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.2483221476510067) internal successors, (372), 298 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 372 transitions. [2023-11-29 05:57:15,331 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 372 transitions. Word has length 69 [2023-11-29 05:57:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:15,331 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 372 transitions. [2023-11-29 05:57:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.1607142857142856) internal successors, (177), 55 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 372 transitions. [2023-11-29 05:57:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 05:57:15,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:15,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:15,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:57:15,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:57:15,539 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:15,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash 919005465, now seen corresponding path program 1 times [2023-11-29 05:57:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913314688] [2023-11-29 05:57:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:15,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:15,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:57:15,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:57:15,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:57:15,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:57:15,793 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:15,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:57:15,834 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 05:57:15,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 05:57:15,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 05:57:15,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 05:57:15,836 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 05:57:15,837 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 05:57:15,838 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-29 05:57:15,839 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-29 05:57:15,842 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-29 05:57:15,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 05:57:15,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 05:57:15,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 05:57:15,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-29 05:57:15,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-29 05:57:15,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-29 05:57:15,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 05:57:15,856 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 05:57:15,857 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 05:57:15,858 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-29 05:57:15,859 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-29 05:57:15,861 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-29 05:57:15,862 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 05:57:15,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 05:57:15,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 05:57:15,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-29 05:57:15,866 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:15,866 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:15,866 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:15,867 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:15,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:57:15 BoogieIcfgContainer [2023-11-29 05:57:15,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:57:15,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:57:15,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:57:15,886 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:57:15,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:47:40" (3/4) ... [2023-11-29 05:57:15,888 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:57:15,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:57:15,890 INFO L158 Benchmark]: Toolchain (without parser) took 576152.94ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 120.1MB in the beginning and 100.9MB in the end (delta: 19.2MB). Peak memory consumption was 202.4MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,890 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:57:15,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.01ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 108.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.22ms. Allocated memory is still 159.4MB. Free memory was 108.2MB in the beginning and 104.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,891 INFO L158 Benchmark]: Boogie Preprocessor took 88.65ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 129.4MB in the end (delta: -24.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,892 INFO L158 Benchmark]: RCFGBuilder took 446.66ms. Allocated memory is still 159.4MB. Free memory was 129.4MB in the beginning and 107.3MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,892 INFO L158 Benchmark]: TraceAbstraction took 575280.43ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 106.6MB in the beginning and 100.9MB in the end (delta: 5.7MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2023-11-29 05:57:15,892 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:57:15,894 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.18ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.01ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 108.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.22ms. Allocated memory is still 159.4MB. Free memory was 108.2MB in the beginning and 104.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.65ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 129.4MB in the end (delta: -24.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 446.66ms. Allocated memory is still 159.4MB. Free memory was 129.4MB in the beginning and 107.3MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 575280.43ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 106.6MB in the beginning and 100.9MB in the end (delta: 5.7MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 22]: 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 bitwiseAnd at line 78. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13_arg_0=255, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13_arg_0=255, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=255, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=255, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=255, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=255, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L22] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 575.1s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 345.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13244 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13244 mSDsluCounter, 3466 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2996 mSDsCounter, 770 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7949 IncrementalHoareTripleChecker+Invalid, 8719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 770 mSolverCounterUnsat, 470 mSDtfsCounter, 7949 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 570 SyntacticMatches, 4 SemanticMatches, 821 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35402 ImplicationChecksByTransitivity, 415.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=15, InterpolantAutomatonStates: 571, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1906 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 225.3s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1306 ConstructedInterpolants, 10 QuantifiedInterpolants, 47727 SizeOfPredicates, 195 NumberOfNonLiveVariables, 2185 ConjunctsInSsa, 530 ConjunctsInUnsatCore, 31 InterpolantComputations, 8 PerfectInterpolantSequences, 394/779 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 [2023-11-29 05:57:16,110 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 05:57:16,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya --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 64bit --witnessprinter.graph.data.programhash c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:57:17,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:57:17,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-29 05:57:17,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:57:17,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:57:17,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:57:17,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:57:17,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:57:17,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:57:17,975 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:57:17,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:57:17,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:57:17,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:57:17,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:57:17,979 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:57:17,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:57:17,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:57:17,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:57:17,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:57:17,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:57:17,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:57:17,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:57:17,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:57:17,984 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:57:17,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:57:17,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:57:17,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:57:17,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:57:17,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:57:17,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:57:17,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:57:17,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:57:17,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:57:17,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:57:17,988 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:57:17,988 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:57:17,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:57:17,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:57:17,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:57:17,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:57:17,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:57:17,990 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:57:17,990 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_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa [2023-11-29 05:57:18,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:57:18,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:57:18,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:57:18,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:57:18,305 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:57:18,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2023-11-29 05:57:21,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:57:21,310 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:57:21,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2023-11-29 05:57:21,320 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/176165707/49ae79965b9940eb90daa285e7bc8537/FLAG86e72fdc6 [2023-11-29 05:57:21,336 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/data/176165707/49ae79965b9940eb90daa285e7bc8537 [2023-11-29 05:57:21,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:57:21,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:57:21,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:57:21,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:57:21,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:57:21,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e84cebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21, skipping insertion in model container [2023-11-29 05:57:21,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,375 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:57:21,533 WARN L240 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_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2023-11-29 05:57:21,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:57:21,581 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:57:21,594 WARN L240 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_8d039712-89d1-41ec-b18f-edbc0dc35041/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2023-11-29 05:57:21,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:57:21,626 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:57:21,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21 WrapperNode [2023-11-29 05:57:21,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:57:21,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:57:21,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:57:21,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:57:21,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,669 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-11-29 05:57:21,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:57:21,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:57:21,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:57:21,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:57:21,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,697 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]. [2023-11-29 05:57:21,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:57:21,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:57:21,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:57:21,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:57:21,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (1/1) ... [2023-11-29 05:57:21,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:57:21,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:57:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:57:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:57:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:57:21,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:57:21,868 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:57:21,870 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:57:22,005 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:57:22,036 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:57:22,036 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:57:22,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:57:22 BoogieIcfgContainer [2023-11-29 05:57:22,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:57:22,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:57:22,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:57:22,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:57:22,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:57:21" (1/3) ... [2023-11-29 05:57:22,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61039a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:57:22, skipping insertion in model container [2023-11-29 05:57:22,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:21" (2/3) ... [2023-11-29 05:57:22,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61039a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:57:22, skipping insertion in model container [2023-11-29 05:57:22,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:57:22" (3/3) ... [2023-11-29 05:57:22,045 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2023-11-29 05:57:22,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:57:22,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:57:22,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:57:22,104 INFO L357 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, mHoare=true, 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;@a058edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:57:22,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:57:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:57:22,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:22,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:57:22,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:22,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-11-29 05:57:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482079550] [2023-11-29 05:57:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:22,130 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 [2023-11-29 05:57:22,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:22,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:57:22,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:22,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:22,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482079550] [2023-11-29 05:57:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482079550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:57:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393903763] [2023-11-29 05:57:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:22,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:57:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:57:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:57:22,392 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:22,443 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-11-29 05:57:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:57:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:57:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:22,452 INFO L225 Difference]: With dead ends: 16 [2023-11-29 05:57:22,452 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 05:57:22,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:57:22,458 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:22,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 05:57:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-29 05:57:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 05:57:22,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-29 05:57:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:22,488 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 05:57:22,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 05:57:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:57:22,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:22,489 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-29 05:57:22,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:22,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:22,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:22,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-11-29 05:57:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045271486] [2023-11-29 05:57:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:22,693 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 [2023-11-29 05:57:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:22,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:57:22,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:23,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:23,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045271486] [2023-11-29 05:57:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045271486] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:23,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-29 05:57:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595790868] [2023-11-29 05:57:23,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:23,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:57:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:23,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:57:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:57:23,294 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:23,472 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-29 05:57:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:57:23,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 05:57:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:23,474 INFO L225 Difference]: With dead ends: 17 [2023-11-29 05:57:23,474 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 05:57:23,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:57:23,476 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:23,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:57:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 05:57:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-29 05:57:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-11-29 05:57:23,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-11-29 05:57:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:23,482 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-11-29 05:57:23,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-11-29 05:57:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 05:57:23,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:23,484 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-11-29 05:57:23,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:57:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:23,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:23,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-11-29 05:57:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841827073] [2023-11-29 05:57:23,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:57:23,687 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 [2023-11-29 05:57:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:23,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:57:23,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:23,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:57:23,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:57:23,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:57:23,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:25,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:30,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841827073] [2023-11-29 05:57:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841827073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:30,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 05:57:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133706116] [2023-11-29 05:57:30,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:57:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:57:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:57:30,659 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:30,983 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2023-11-29 05:57:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:57:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 05:57:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:30,984 INFO L225 Difference]: With dead ends: 20 [2023-11-29 05:57:30,984 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 05:57:30,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:57:30,986 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:30,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:57:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 05:57:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-11-29 05:57:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-11-29 05:57:30,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2023-11-29 05:57:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:30,993 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-11-29 05:57:30,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-11-29 05:57:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 05:57:30,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:30,993 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2023-11-29 05:57:30,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:31,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:31,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -310375345, now seen corresponding path program 3 times [2023-11-29 05:57:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269169049] [2023-11-29 05:57:31,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:57:31,196 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 [2023-11-29 05:57:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:31,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:57:31,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:31,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 05:57:31,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:57:31,303 WARN L260 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 05:57:31,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:32,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:57:49,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:49,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269169049] [2023-11-29 05:57:49,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269169049] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:49,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:49,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-11-29 05:57:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50886261] [2023-11-29 05:57:49,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:49,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:57:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:57:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:57:49,310 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:50,357 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-11-29 05:57:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:57:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 05:57:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:50,358 INFO L225 Difference]: With dead ends: 26 [2023-11-29 05:57:50,358 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 05:57:50,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:57:50,359 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:50,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:57:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 05:57:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-11-29 05:57:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-11-29 05:57:50,365 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-11-29 05:57:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:50,365 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-11-29 05:57:50,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:57:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-11-29 05:57:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 05:57:50,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:50,366 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2023-11-29 05:57:50,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:57:50,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:50,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:50,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 223328655, now seen corresponding path program 4 times [2023-11-29 05:57:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674954445] [2023-11-29 05:57:50,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:57:50,568 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 [2023-11-29 05:57:50,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:50,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:57:50,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:50,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:57:50,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:57:50,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:57:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:57:50,870 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:57:50,870 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:57:50,871 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:57:50,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:57:51,076 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-11-29 05:57:51,079 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:57:51,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,115 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,115 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,115 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,115 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:57:51 BoogieIcfgContainer [2023-11-29 05:57:51,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:57:51,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:57:51,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:57:51,132 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:57:51,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:57:22" (3/4) ... [2023-11-29 05:57:51,133 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,149 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,150 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 05:57:51,210 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:57:51,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:57:51,211 INFO L158 Benchmark]: Toolchain (without parser) took 29870.39ms. Allocated memory was 90.2MB in the beginning and 383.8MB in the end (delta: 293.6MB). Free memory was 66.5MB in the beginning and 135.1MB in the end (delta: -68.5MB). Peak memory consumption was 226.1MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,211 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:57:51,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.72ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 54.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,212 INFO L158 Benchmark]: Boogie Preprocessor took 44.55ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 50.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,212 INFO L158 Benchmark]: RCFGBuilder took 321.81ms. Allocated memory is still 90.2MB. Free memory was 50.6MB in the beginning and 58.8MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,213 INFO L158 Benchmark]: TraceAbstraction took 29092.17ms. Allocated memory was 90.2MB in the beginning and 383.8MB in the end (delta: 293.6MB). Free memory was 58.0MB in the beginning and 142.4MB in the end (delta: -84.4MB). Peak memory consumption was 212.0MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,213 INFO L158 Benchmark]: Witness Printer took 78.31ms. Allocated memory is still 383.8MB. Free memory was 142.4MB in the beginning and 135.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:57:51,215 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.18ms. Allocated memory is still 65.0MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.72ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 54.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.55ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 50.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.81ms. Allocated memory is still 90.2MB. Free memory was 50.6MB in the beginning and 58.8MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29092.17ms. Allocated memory was 90.2MB in the beginning and 383.8MB in the end (delta: 293.6MB). Free memory was 58.0MB in the beginning and 142.4MB in the end (delta: -84.4MB). Peak memory consumption was 212.0MB. Max. memory is 16.1GB. * Witness Printer took 78.31ms. Allocated memory is still 383.8MB. Free memory was 142.4MB in the beginning and 135.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=0, state_5=1, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=0, var_13_arg_0=1, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=0, state_5=2, state_6=0, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=0, var_13_arg_0=1, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=1, state_5=2, state_6=1, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=2, var_12_arg_2=3, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=3, state_5=2, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=4, var_11_arg_0=3, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=1, var_13_arg_1=3, var_13_arg_2=4, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=1, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L22] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 8 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 69 ConstructedInterpolants, 40 QuantifiedInterpolants, 37806 SizeOfPredicates, 188 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/86 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 proved your program to be incorrect! [2023-11-29 05:57:51,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d039712-89d1-41ec-b18f-edbc0dc35041/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE