./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:39,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:39,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:46:39,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:39,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:39,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:39,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:39,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:39,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:39,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:39,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:39,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:39,486 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:39,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:39,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:46:39,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:39,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:39,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:46:39,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:39,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:46:39,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:46:39,493 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:39,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:39,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:39,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:39,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:39,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:39,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:39,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:46:39,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:39,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:39,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:39,498 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:46:39,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:39,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:39,499 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:39,499 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2023-11-06 22:46:39,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:39,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:39,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:39,914 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:39,915 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:39,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:46:43,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:43,614 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:43,615 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:46:43,628 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/0316637ab/c4abac4b1a294b5bbb550ee812d1622b/FLAGb0d27c29d [2023-11-06 22:46:43,646 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/0316637ab/c4abac4b1a294b5bbb550ee812d1622b [2023-11-06 22:46:43,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:43,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:43,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:43,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:43,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:43,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:43" (1/1) ... [2023-11-06 22:46:43,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10220921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:43, skipping insertion in model container [2023-11-06 22:46:43,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:43" (1/1) ... [2023-11-06 22:46:43,739 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:43,950 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2023-11-06 22:46:44,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:44,204 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:44,215 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2023-11-06 22:46:44,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:44,322 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:44,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44 WrapperNode [2023-11-06 22:46:44,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:44,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:44,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:44,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:44,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,565 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1873 [2023-11-06 22:46:44,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:44,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:44,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:44,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:44,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:44,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:44,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:44,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:44,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (1/1) ... [2023-11-06 22:46:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:44,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:44,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:44,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:45,335 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:45,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:47,812 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:47,827 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:47,828 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:46:47,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:47 BoogieIcfgContainer [2023-11-06 22:46:47,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:47,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:47,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:47,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:43" (1/3) ... [2023-11-06 22:46:47,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab33330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:47, skipping insertion in model container [2023-11-06 22:46:47,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:44" (2/3) ... [2023-11-06 22:46:47,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab33330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:47, skipping insertion in model container [2023-11-06 22:46:47,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:47" (3/3) ... [2023-11-06 22:46:47,843 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:46:47,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:47,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:46:47,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:47,955 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=LoopsAndPotentialCycles, 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;@4a99d27b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:47,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:46:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 450 states have internal predecessors, (749), 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-06 22:46:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:46:47,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:47,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:47,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:47,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash -605321278, now seen corresponding path program 1 times [2023-11-06 22:46:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404158491] [2023-11-06 22:46:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:48,698 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-06 22:46:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404158491] [2023-11-06 22:46:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404158491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:48,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:48,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915019379] [2023-11-06 22:46:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:48,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:48,771 INFO L87 Difference]: Start difference. First operand has 451 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 450 states have internal predecessors, (749), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06 22:46:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:48,957 INFO L93 Difference]: Finished difference Result 885 states and 1476 transitions. [2023-11-06 22:46:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2023-11-06 22:46:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:48,979 INFO L225 Difference]: With dead ends: 885 [2023-11-06 22:46:48,979 INFO L226 Difference]: Without dead ends: 466 [2023-11-06 22:46:48,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 22:46:48,990 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 1397 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:48,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 848 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-11-06 22:46:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 447. [2023-11-06 22:46:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.663677130044843) internal successors, (742), 446 states have internal predecessors, (742), 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-06 22:46:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 742 transitions. [2023-11-06 22:46:49,112 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 742 transitions. Word has length 59 [2023-11-06 22:46:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:49,113 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 742 transitions. [2023-11-06 22:46:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06 22:46:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 742 transitions. [2023-11-06 22:46:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:46:49,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:49,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:49,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:49,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:49,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1917691606, now seen corresponding path program 1 times [2023-11-06 22:46:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78711653] [2023-11-06 22:46:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:49,625 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-06 22:46:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:49,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78711653] [2023-11-06 22:46:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78711653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:49,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869474140] [2023-11-06 22:46:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:49,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:49,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:49,634 INFO L87 Difference]: Start difference. First operand 447 states and 742 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-06 22:46:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:49,689 INFO L93 Difference]: Finished difference Result 451 states and 746 transitions. [2023-11-06 22:46:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2023-11-06 22:46:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:49,699 INFO L225 Difference]: With dead ends: 451 [2023-11-06 22:46:49,700 INFO L226 Difference]: Without dead ends: 449 [2023-11-06 22:46:49,707 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-06 22:46:49,711 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 1 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:49,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2214 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-06 22:46:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2023-11-06 22:46:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6607142857142858) internal successors, (744), 448 states have internal predecessors, (744), 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-06 22:46:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 744 transitions. [2023-11-06 22:46:49,771 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 744 transitions. Word has length 60 [2023-11-06 22:46:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:49,772 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 744 transitions. [2023-11-06 22:46:49,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-06 22:46:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 744 transitions. [2023-11-06 22:46:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:46:49,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:49,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:49,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:49,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:49,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash -679377056, now seen corresponding path program 1 times [2023-11-06 22:46:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103358662] [2023-11-06 22:46:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:50,043 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-06 22:46:50,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103358662] [2023-11-06 22:46:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103358662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:50,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:50,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555285864] [2023-11-06 22:46:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:50,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:50,048 INFO L87 Difference]: Start difference. First operand 449 states and 744 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 22:46:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:50,094 INFO L93 Difference]: Finished difference Result 869 states and 1440 transitions. [2023-11-06 22:46:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2023-11-06 22:46:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:50,100 INFO L225 Difference]: With dead ends: 869 [2023-11-06 22:46:50,101 INFO L226 Difference]: Without dead ends: 452 [2023-11-06 22:46:50,105 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-06 22:46:50,110 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 1 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:50,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-06 22:46:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 451. [2023-11-06 22:46:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.6577777777777778) internal successors, (746), 450 states have internal predecessors, (746), 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-06 22:46:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 746 transitions. [2023-11-06 22:46:50,130 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 746 transitions. Word has length 61 [2023-11-06 22:46:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:50,132 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 746 transitions. [2023-11-06 22:46:50,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 22:46:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 746 transitions. [2023-11-06 22:46:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:46:50,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:50,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:50,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:50,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:50,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash 203715632, now seen corresponding path program 1 times [2023-11-06 22:46:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727324065] [2023-11-06 22:46:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:50,387 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-06 22:46:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727324065] [2023-11-06 22:46:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727324065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:50,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474331909] [2023-11-06 22:46:50,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:50,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:50,391 INFO L87 Difference]: Start difference. First operand 451 states and 746 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-06 22:46:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:50,468 INFO L93 Difference]: Finished difference Result 1279 states and 2119 transitions. [2023-11-06 22:46:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2023-11-06 22:46:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:50,478 INFO L225 Difference]: With dead ends: 1279 [2023-11-06 22:46:50,478 INFO L226 Difference]: Without dead ends: 860 [2023-11-06 22:46:50,479 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-06 22:46:50,487 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 676 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:50,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2369 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-06 22:46:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 453. [2023-11-06 22:46:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.654867256637168) internal successors, (748), 452 states have internal predecessors, (748), 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-06 22:46:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 748 transitions. [2023-11-06 22:46:50,509 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 748 transitions. Word has length 62 [2023-11-06 22:46:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:50,510 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 748 transitions. [2023-11-06 22:46:50,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-06 22:46:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 748 transitions. [2023-11-06 22:46:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:46:50,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:50,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:50,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:50,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -674842874, now seen corresponding path program 1 times [2023-11-06 22:46:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718610412] [2023-11-06 22:46:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,326 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-06 22:46:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718610412] [2023-11-06 22:46:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718610412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:46:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203425926] [2023-11-06 22:46:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:46:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:46:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:51,331 INFO L87 Difference]: Start difference. First operand 453 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-06 22:46:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:51,552 INFO L93 Difference]: Finished difference Result 1289 states and 2131 transitions. [2023-11-06 22:46:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 63 [2023-11-06 22:46:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:51,559 INFO L225 Difference]: With dead ends: 1289 [2023-11-06 22:46:51,559 INFO L226 Difference]: Without dead ends: 868 [2023-11-06 22:46:51,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:46:51,561 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 2648 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 3913 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:51,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 3913 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2023-11-06 22:46:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 456. [2023-11-06 22:46:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.6549450549450548) internal successors, (753), 455 states have internal predecessors, (753), 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-06 22:46:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 753 transitions. [2023-11-06 22:46:51,580 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 753 transitions. Word has length 63 [2023-11-06 22:46:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:51,580 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 753 transitions. [2023-11-06 22:46:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-06 22:46:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 753 transitions. [2023-11-06 22:46:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:46:51,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:51,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:51,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:46:51,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:51,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2066517898, now seen corresponding path program 1 times [2023-11-06 22:46:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148270810] [2023-11-06 22:46:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,898 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-06 22:46:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148270810] [2023-11-06 22:46:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148270810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:46:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788802001] [2023-11-06 22:46:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:51,902 INFO L87 Difference]: Start difference. First operand 456 states and 753 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-06 22:46:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:52,785 INFO L93 Difference]: Finished difference Result 1304 states and 2155 transitions. [2023-11-06 22:46:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2023-11-06 22:46:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:52,792 INFO L225 Difference]: With dead ends: 1304 [2023-11-06 22:46:52,792 INFO L226 Difference]: Without dead ends: 880 [2023-11-06 22:46:52,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:52,794 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 2067 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:52,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 1658 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:46:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-11-06 22:46:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 510. [2023-11-06 22:46:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6483300589390963) internal successors, (839), 509 states have internal predecessors, (839), 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-06 22:46:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 839 transitions. [2023-11-06 22:46:52,815 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 839 transitions. Word has length 64 [2023-11-06 22:46:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:52,816 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 839 transitions. [2023-11-06 22:46:52,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-06 22:46:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 839 transitions. [2023-11-06 22:46:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:46:52,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:52,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:52,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:46:52,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:52,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1673490888, now seen corresponding path program 1 times [2023-11-06 22:46:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435209933] [2023-11-06 22:46:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:53,504 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-06 22:46:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435209933] [2023-11-06 22:46:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435209933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:46:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612032951] [2023-11-06 22:46:53,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:53,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:46:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:46:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:46:53,508 INFO L87 Difference]: Start difference. First operand 510 states and 839 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-06 22:46:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:54,217 INFO L93 Difference]: Finished difference Result 985 states and 1619 transitions. [2023-11-06 22:46:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:46:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2023-11-06 22:46:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:54,221 INFO L225 Difference]: With dead ends: 985 [2023-11-06 22:46:54,221 INFO L226 Difference]: Without dead ends: 558 [2023-11-06 22:46:54,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:46:54,223 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 740 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:54,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3448 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:46:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-11-06 22:46:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 522. [2023-11-06 22:46:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.6449136276391554) internal successors, (857), 521 states have internal predecessors, (857), 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-06 22:46:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 857 transitions. [2023-11-06 22:46:54,240 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 857 transitions. Word has length 64 [2023-11-06 22:46:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:54,241 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 857 transitions. [2023-11-06 22:46:54,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-06 22:46:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 857 transitions. [2023-11-06 22:46:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:46:54,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:54,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:54,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:46:54,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:54,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1086684874, now seen corresponding path program 1 times [2023-11-06 22:46:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031132972] [2023-11-06 22:46:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:54,814 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-06 22:46:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031132972] [2023-11-06 22:46:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031132972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:46:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538553101] [2023-11-06 22:46:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:46:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:46:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:46:54,818 INFO L87 Difference]: Start difference. First operand 522 states and 857 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-06 22:46:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:55,288 INFO L93 Difference]: Finished difference Result 986 states and 1618 transitions. [2023-11-06 22:46:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2023-11-06 22:46:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:55,292 INFO L225 Difference]: With dead ends: 986 [2023-11-06 22:46:55,293 INFO L226 Difference]: Without dead ends: 544 [2023-11-06 22:46:55,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:46:55,294 INFO L413 NwaCegarLoop]: 713 mSDtfsCounter, 724 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:55,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 4227 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:46:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-11-06 22:46:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 524. [2023-11-06 22:46:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.6424474187380498) internal successors, (859), 523 states have internal predecessors, (859), 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-06 22:46:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 859 transitions. [2023-11-06 22:46:55,311 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 859 transitions. Word has length 64 [2023-11-06 22:46:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:55,311 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 859 transitions. [2023-11-06 22:46:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-06 22:46:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 859 transitions. [2023-11-06 22:46:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:46:55,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:55,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:55,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:46:55,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:55,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -15452854, now seen corresponding path program 1 times [2023-11-06 22:46:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372727512] [2023-11-06 22:46:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:55,588 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-06 22:46:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372727512] [2023-11-06 22:46:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372727512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:55,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:55,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702805851] [2023-11-06 22:46:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:55,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:55,591 INFO L87 Difference]: Start difference. First operand 524 states and 859 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-06 22:46:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:55,749 INFO L93 Difference]: Finished difference Result 1397 states and 2289 transitions. [2023-11-06 22:46:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2023-11-06 22:46:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:55,757 INFO L225 Difference]: With dead ends: 1397 [2023-11-06 22:46:55,757 INFO L226 Difference]: Without dead ends: 952 [2023-11-06 22:46:55,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:55,760 INFO L413 NwaCegarLoop]: 1356 mSDtfsCounter, 1360 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:55,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 2059 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2023-11-06 22:46:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 524. [2023-11-06 22:46:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.6386233269598471) internal successors, (857), 523 states have internal predecessors, (857), 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-06 22:46:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 857 transitions. [2023-11-06 22:46:55,786 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 857 transitions. Word has length 64 [2023-11-06 22:46:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:55,787 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 857 transitions. [2023-11-06 22:46:55,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-06 22:46:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 857 transitions. [2023-11-06 22:46:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:46:55,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:55,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:46:55,789 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:55,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1758059830, now seen corresponding path program 1 times [2023-11-06 22:46:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343943614] [2023-11-06 22:46:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,045 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-06 22:46:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343943614] [2023-11-06 22:46:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343943614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:46:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957446429] [2023-11-06 22:46:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:56,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:56,048 INFO L87 Difference]: Start difference. First operand 524 states and 857 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-06 22:46:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:56,269 INFO L93 Difference]: Finished difference Result 1775 states and 2910 transitions. [2023-11-06 22:46:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2023-11-06 22:46:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:56,278 INFO L225 Difference]: With dead ends: 1775 [2023-11-06 22:46:56,278 INFO L226 Difference]: Without dead ends: 1327 [2023-11-06 22:46:56,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:56,280 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 1278 mSDsluCounter, 4135 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 5522 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:56,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 5522 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2023-11-06 22:46:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 534. [2023-11-06 22:46:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.6266416510318948) internal successors, (867), 533 states have internal predecessors, (867), 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-06 22:46:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 867 transitions. [2023-11-06 22:46:56,307 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 867 transitions. Word has length 65 [2023-11-06 22:46:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:56,308 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 867 transitions. [2023-11-06 22:46:56,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-06 22:46:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 867 transitions. [2023-11-06 22:46:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:46:56,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:56,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:56,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:46:56,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:56,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1696185432, now seen corresponding path program 1 times [2023-11-06 22:46:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845080447] [2023-11-06 22:46:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,465 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-06 22:46:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845080447] [2023-11-06 22:46:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845080447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880602973] [2023-11-06 22:46:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:56,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:56,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:56,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:56,472 INFO L87 Difference]: Start difference. First operand 534 states and 867 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-06 22:46:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:56,508 INFO L93 Difference]: Finished difference Result 1013 states and 1644 transitions. [2023-11-06 22:46:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2023-11-06 22:46:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:56,514 INFO L225 Difference]: With dead ends: 1013 [2023-11-06 22:46:56,514 INFO L226 Difference]: Without dead ends: 548 [2023-11-06 22:46:56,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:56,516 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 6 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:56,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1476 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-11-06 22:46:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 536. [2023-11-06 22:46:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.6242990654205607) internal successors, (869), 535 states have internal predecessors, (869), 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-06 22:46:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 869 transitions. [2023-11-06 22:46:56,540 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 869 transitions. Word has length 65 [2023-11-06 22:46:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:56,540 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 869 transitions. [2023-11-06 22:46:56,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-06 22:46:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 869 transitions. [2023-11-06 22:46:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:46:56,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:56,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:46:56,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:56,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -179877851, now seen corresponding path program 1 times [2023-11-06 22:46:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348425840] [2023-11-06 22:46:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,657 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-06 22:46:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348425840] [2023-11-06 22:46:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348425840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65933900] [2023-11-06 22:46:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:56,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:56,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:56,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:56,660 INFO L87 Difference]: Start difference. First operand 536 states and 869 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-06 22:46:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:56,878 INFO L93 Difference]: Finished difference Result 1856 states and 3015 transitions. [2023-11-06 22:46:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2023-11-06 22:46:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:56,887 INFO L225 Difference]: With dead ends: 1856 [2023-11-06 22:46:56,887 INFO L226 Difference]: Without dead ends: 1400 [2023-11-06 22:46:56,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:56,889 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 1324 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:56,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 2784 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-11-06 22:46:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 973. [2023-11-06 22:46:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.618312757201646) internal successors, (1573), 972 states have internal predecessors, (1573), 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-06 22:46:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1573 transitions. [2023-11-06 22:46:56,923 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1573 transitions. Word has length 66 [2023-11-06 22:46:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:56,923 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1573 transitions. [2023-11-06 22:46:56,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-06 22:46:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1573 transitions. [2023-11-06 22:46:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:46:56,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:56,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:56,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:46:56,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:56,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash 477648191, now seen corresponding path program 1 times [2023-11-06 22:46:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997369649] [2023-11-06 22:46:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:57,238 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-06 22:46:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997369649] [2023-11-06 22:46:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997369649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:46:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577062452] [2023-11-06 22:46:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:57,241 INFO L87 Difference]: Start difference. First operand 973 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-06 22:46:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:57,457 INFO L93 Difference]: Finished difference Result 2275 states and 3691 transitions. [2023-11-06 22:46:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:57,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2023-11-06 22:46:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:57,468 INFO L225 Difference]: With dead ends: 2275 [2023-11-06 22:46:57,468 INFO L226 Difference]: Without dead ends: 1391 [2023-11-06 22:46:57,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:57,471 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 1370 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:57,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 2036 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-06 22:46:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 973. [2023-11-06 22:46:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.6080246913580247) internal successors, (1563), 972 states have internal predecessors, (1563), 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-06 22:46:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1563 transitions. [2023-11-06 22:46:57,517 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1563 transitions. Word has length 66 [2023-11-06 22:46:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:57,517 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1563 transitions. [2023-11-06 22:46:57,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-06 22:46:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1563 transitions. [2023-11-06 22:46:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:46:57,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:57,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:57,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:46:57,520 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:57,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1051239942, now seen corresponding path program 1 times [2023-11-06 22:46:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233114157] [2023-11-06 22:46:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:57,728 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-06 22:46:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233114157] [2023-11-06 22:46:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233114157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4774269] [2023-11-06 22:46:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:57,731 INFO L87 Difference]: Start difference. First operand 973 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-06 22:46:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:57,766 INFO L93 Difference]: Finished difference Result 1819 states and 2933 transitions. [2023-11-06 22:46:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:57,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2023-11-06 22:46:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:57,770 INFO L225 Difference]: With dead ends: 1819 [2023-11-06 22:46:57,770 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 22:46:57,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:57,774 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:57,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1468 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 22:46:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2023-11-06 22:46:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.6041275797373358) internal successors, (855), 533 states have internal predecessors, (855), 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-06 22:46:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 855 transitions. [2023-11-06 22:46:57,796 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 855 transitions. Word has length 67 [2023-11-06 22:46:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:57,796 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 855 transitions. [2023-11-06 22:46:57,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-06 22:46:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 855 transitions. [2023-11-06 22:46:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:46:57,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:57,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:57,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:46:57,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:57,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 700173342, now seen corresponding path program 1 times [2023-11-06 22:46:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121270620] [2023-11-06 22:46:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:58,343 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-06 22:46:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121270620] [2023-11-06 22:46:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121270620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:58,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:46:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777668845] [2023-11-06 22:46:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:58,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:46:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:46:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:46:58,346 INFO L87 Difference]: Start difference. First operand 534 states and 855 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-06 22:46:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:58,579 INFO L93 Difference]: Finished difference Result 987 states and 1587 transitions. [2023-11-06 22:46:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2023-11-06 22:46:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:58,583 INFO L225 Difference]: With dead ends: 987 [2023-11-06 22:46:58,583 INFO L226 Difference]: Without dead ends: 536 [2023-11-06 22:46:58,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:46:58,586 INFO L413 NwaCegarLoop]: 765 mSDtfsCounter, 1379 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:58,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 3034 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-11-06 22:46:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2023-11-06 22:46:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.6049149338374291) internal successors, (849), 529 states have internal predecessors, (849), 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-06 22:46:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 849 transitions. [2023-11-06 22:46:58,603 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 849 transitions. Word has length 67 [2023-11-06 22:46:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:58,603 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 849 transitions. [2023-11-06 22:46:58,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-06 22:46:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 849 transitions. [2023-11-06 22:46:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:46:58,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:58,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:58,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:46:58,606 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:58,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -117475108, now seen corresponding path program 1 times [2023-11-06 22:46:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:58,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548970972] [2023-11-06 22:46:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,015 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-06 22:46:59,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548970972] [2023-11-06 22:46:59,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548970972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:59,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:59,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:46:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676808458] [2023-11-06 22:46:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:59,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:59,022 INFO L87 Difference]: Start difference. First operand 530 states and 849 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-06 22:46:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:59,155 INFO L93 Difference]: Finished difference Result 1015 states and 1619 transitions. [2023-11-06 22:46:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2023-11-06 22:46:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:59,159 INFO L225 Difference]: With dead ends: 1015 [2023-11-06 22:46:59,160 INFO L226 Difference]: Without dead ends: 542 [2023-11-06 22:46:59,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:46:59,161 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1400 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:59,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 2363 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:46:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-11-06 22:46:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 534. [2023-11-06 22:46:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.596622889305816) internal successors, (851), 533 states have internal predecessors, (851), 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-06 22:46:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 851 transitions. [2023-11-06 22:46:59,179 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 851 transitions. Word has length 67 [2023-11-06 22:46:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 851 transitions. [2023-11-06 22:46:59,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-06 22:46:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 851 transitions. [2023-11-06 22:46:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:46:59,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:59,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:46:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:46:59,181 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:59,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1776852763, now seen corresponding path program 1 times [2023-11-06 22:46:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958522232] [2023-11-06 22:46:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,539 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-06 22:46:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958522232] [2023-11-06 22:46:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958522232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:46:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103061582] [2023-11-06 22:46:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:59,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:46:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:46:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:46:59,542 INFO L87 Difference]: Start difference. First operand 534 states and 851 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-06 22:46:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:59,982 INFO L93 Difference]: Finished difference Result 1847 states and 2969 transitions. [2023-11-06 22:46:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:46:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2023-11-06 22:46:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:59,992 INFO L225 Difference]: With dead ends: 1847 [2023-11-06 22:46:59,992 INFO L226 Difference]: Without dead ends: 1402 [2023-11-06 22:46:59,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:46:59,994 INFO L413 NwaCegarLoop]: 2014 mSDtfsCounter, 1406 mSDsluCounter, 10085 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 12099 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:59,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 12099 Invalid, 159 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2023-11-06 22:47:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 548. [2023-11-06 22:47:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5886654478976234) internal successors, (869), 547 states have internal predecessors, (869), 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-06 22:47:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 869 transitions. [2023-11-06 22:47:00,022 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 869 transitions. Word has length 68 [2023-11-06 22:47:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:00,023 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 869 transitions. [2023-11-06 22:47:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-06 22:47:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 869 transitions. [2023-11-06 22:47:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:47:00,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:00,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:47:00,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:47:00,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:00,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 188504861, now seen corresponding path program 1 times [2023-11-06 22:47:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829836193] [2023-11-06 22:47:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,575 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-06 22:47:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829836193] [2023-11-06 22:47:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829836193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:00,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:00,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:47:00,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971865456] [2023-11-06 22:47:00,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:00,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:47:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:00,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:47:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:00,578 INFO L87 Difference]: Start difference. First operand 548 states and 869 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 22:47:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:01,122 INFO L93 Difference]: Finished difference Result 1429 states and 2289 transitions. [2023-11-06 22:47:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2023-11-06 22:47:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:01,129 INFO L225 Difference]: With dead ends: 1429 [2023-11-06 22:47:01,130 INFO L226 Difference]: Without dead ends: 986 [2023-11-06 22:47:01,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:47:01,132 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 2027 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5436 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:01,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5436 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:47:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2023-11-06 22:47:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 548. [2023-11-06 22:47:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5886654478976234) internal successors, (869), 547 states have internal predecessors, (869), 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-06 22:47:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 869 transitions. [2023-11-06 22:47:01,162 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 869 transitions. Word has length 68 [2023-11-06 22:47:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:01,162 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 869 transitions. [2023-11-06 22:47:01,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 22:47:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 869 transitions. [2023-11-06 22:47:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:47:01,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:01,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:47:01,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:47:01,164 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:01,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash -398301153, now seen corresponding path program 1 times [2023-11-06 22:47:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009133199] [2023-11-06 22:47:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,695 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-06 22:47:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009133199] [2023-11-06 22:47:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009133199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:47:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134916167] [2023-11-06 22:47:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:01,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:47:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:47:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:01,700 INFO L87 Difference]: Start difference. First operand 548 states and 869 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 22:47:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:01,885 INFO L93 Difference]: Finished difference Result 1003 states and 1600 transitions. [2023-11-06 22:47:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2023-11-06 22:47:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:01,890 INFO L225 Difference]: With dead ends: 1003 [2023-11-06 22:47:01,890 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 22:47:01,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:47:01,892 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 720 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:01,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2093 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:47:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 22:47:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2023-11-06 22:47:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.5928705440900564) internal successors, (849), 533 states have internal predecessors, (849), 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-06 22:47:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 849 transitions. [2023-11-06 22:47:01,917 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 849 transitions. Word has length 68 [2023-11-06 22:47:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 849 transitions. [2023-11-06 22:47:01,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 22:47:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 849 transitions. [2023-11-06 22:47:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:47:01,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:01,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:47:01,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:47:01,920 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:01,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash -615391585, now seen corresponding path program 1 times [2023-11-06 22:47:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063423587] [2023-11-06 22:47:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:02,148 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-06 22:47:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063423587] [2023-11-06 22:47:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063423587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804973449] [2023-11-06 22:47:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:02,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:02,151 INFO L87 Difference]: Start difference. First operand 534 states and 849 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-06 22:47:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:02,256 INFO L93 Difference]: Finished difference Result 991 states and 1585 transitions. [2023-11-06 22:47:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2023-11-06 22:47:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:02,260 INFO L225 Difference]: With dead ends: 991 [2023-11-06 22:47:02,260 INFO L226 Difference]: Without dead ends: 546 [2023-11-06 22:47:02,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 22:47:02,262 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 701 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:02,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1421 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:47:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-06 22:47:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 536. [2023-11-06 22:47:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.5906542056074766) internal successors, (851), 535 states have internal predecessors, (851), 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-06 22:47:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 851 transitions. [2023-11-06 22:47:02,285 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 851 transitions. Word has length 68 [2023-11-06 22:47:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:02,286 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 851 transitions. [2023-11-06 22:47:02,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-06 22:47:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 851 transitions. [2023-11-06 22:47:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:47:02,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:02,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:47:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:47:02,288 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:02,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2091227809, now seen corresponding path program 1 times [2023-11-06 22:47:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838737694] [2023-11-06 22:47:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:02,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:47:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:02,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:47:02,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:47:02,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:47:02,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:47:02,491 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:02,495 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:47:02,577 WARN L316 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-06 22:47:02,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:02 BoogieIcfgContainer [2023-11-06 22:47:02,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:47:02,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:47:02,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:47:02,603 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:47:02,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:47" (3/4) ... [2023-11-06 22:47:02,606 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:47:02,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:47:02,608 INFO L158 Benchmark]: Toolchain (without parser) took 18957.48ms. Allocated memory was 169.9MB in the beginning and 448.8MB in the end (delta: 278.9MB). Free memory was 135.9MB in the beginning and 232.0MB in the end (delta: -96.1MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,609 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 92.8MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:02,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.58ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 118.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 241.32ms. Allocated memory is still 169.9MB. Free memory was 118.5MB in the beginning and 80.0MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,615 INFO L158 Benchmark]: Boogie Preprocessor took 295.14ms. Allocated memory is still 169.9MB. Free memory was 80.0MB in the beginning and 64.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,615 INFO L158 Benchmark]: RCFGBuilder took 2969.15ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 64.8MB in the beginning and 138.8MB in the end (delta: -74.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,616 INFO L158 Benchmark]: TraceAbstraction took 14767.12ms. Allocated memory was 234.9MB in the beginning and 448.8MB in the end (delta: 213.9MB). Free memory was 138.8MB in the beginning and 232.0MB in the end (delta: -93.2MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2023-11-06 22:47:02,616 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 448.8MB. Free memory is still 232.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:02,622 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.65ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 92.8MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.58ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 118.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 241.32ms. Allocated memory is still 169.9MB. Free memory was 118.5MB in the beginning and 80.0MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 295.14ms. Allocated memory is still 169.9MB. Free memory was 80.0MB in the beginning and 64.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2969.15ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 64.8MB in the beginning and 138.8MB in the end (delta: -74.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14767.12ms. Allocated memory was 234.9MB in the beginning and 448.8MB in the end (delta: 213.9MB). Free memory was 138.8MB in the beginning and 232.0MB in the end (delta: -93.2MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 448.8MB. Free memory is still 232.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 500; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 200; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [__VERIFIER_nondet_ushort() & mask_SORT_3=0, __VERIFIER_nondet_ushort()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [__VERIFIER_nondet_ushort() & mask_SORT_3=0, __VERIFIER_nondet_ushort()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [__VERIFIER_nondet_ushort() & mask_SORT_3=0, __VERIFIER_nondet_ushort()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37 & mask_SORT_1=0, input_37=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38 & mask_SORT_1=0, input_38=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43 & mask_SORT_1=0, input_43=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48 & mask_SORT_1=0, input_48=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52 & mask_SORT_1=0, input_52=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57 & mask_SORT_1=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=200] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29_arg_0 ^ var_29_arg_1=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=200] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=200] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [((SORT_4)var_31_arg_0 << 16) | var_31_arg_1=65536, init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=200] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=200] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=65536, var_5=0, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=65536, var_5=0, var_79=200] [L107] EXPR var_33_arg_0 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0 & mask_SORT_4=501, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=65536, var_5=0, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [(var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4)=501, init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0 & mask_SORT_4=501, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=65536, var_5=0, var_79=200] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=501, var_33_arg_1=16, var_5=0, var_79=200] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [(int)var_33_arg_0 >> var_33_arg_1=500, init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=501, var_33_arg_1=16, var_5=0, var_79=200] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=501, var_33_arg_1=16, var_5=0, var_79=200] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [(var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33=500, init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0 & msb_SORT_4=0, var_33_arg_0=501, var_33_arg_1=16, var_5=0, var_79=200] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33 & mask_SORT_4=500, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_5=0, var_79=200] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_34=1, var_34_arg_0=500, var_34_arg_1=500, var_35_arg_0=255, var_5=0, var_79=200] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_34=1, var_34_arg_0=500, var_34_arg_1=500, var_35_arg_0 & mask_SORT_1=1, var_35_arg_0=255, var_5=0, var_79=200] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_34=1, var_34_arg_0=500, var_34_arg_1=500, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=200] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_34=1, var_34_arg_0=500, var_34_arg_1=500, var_35_arg_0 & var_35_arg_1=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=200] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=500, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=500, var_33_arg_0=501, var_33_arg_1=16, var_34=1, var_34_arg_0=500, var_34_arg_1=500, var_35 & mask_SORT_1=1, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=200] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 451 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21226 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21226 mSDsluCounter, 62679 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43512 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2318 IncrementalHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 19167 mSDtfsCounter, 2318 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=973occurred in iteration=12, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 4659 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 5092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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-06 22:47:02,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:05,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:05,746 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-06 22:47:05,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:05,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:05,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:05,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:05,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:05,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:05,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:05,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:05,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:05,814 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:05,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:05,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:47:05,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:05,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:47:05,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:05,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:47:05,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:05,820 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:47:05,821 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:47:05,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:47:05,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:05,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:05,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:05,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:05,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:05,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:05,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:05,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:47:05,827 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:47:05,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:47:05,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:05,828 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:47:05,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:05,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:05,829 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:47:05,829 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:05,831 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2023-11-06 22:47:06,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:06,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:06,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:06,320 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:06,321 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:06,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:47:09,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:10,010 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:10,012 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:47:10,025 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/dbf8b8b76/16aeb66dbf2343f4bf96a4f2fd3698cb/FLAGee7e41473 [2023-11-06 22:47:10,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/data/dbf8b8b76/16aeb66dbf2343f4bf96a4f2fd3698cb [2023-11-06 22:47:10,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:10,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:10,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:10,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:10,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:10,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6c4d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10, skipping insertion in model container [2023-11-06 22:47:10,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,138 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:10,343 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2023-11-06 22:47:10,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:10,571 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:10,589 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_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2023-11-06 22:47:10,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:10,694 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:10,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10 WrapperNode [2023-11-06 22:47:10,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:10,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:10,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:10,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:10,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,844 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 455 [2023-11-06 22:47:10,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:10,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:10,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:10,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:10,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:10,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:11,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:11,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:11,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:11,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:11,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (1/1) ... [2023-11-06 22:47:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:11,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:11,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:47:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:11,376 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:11,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:12,250 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:12,257 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:12,258 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:47:12,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:12 BoogieIcfgContainer [2023-11-06 22:47:12,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:12,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:12,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:12,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:12,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:10" (1/3) ... [2023-11-06 22:47:12,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3f77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:12, skipping insertion in model container [2023-11-06 22:47:12,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:10" (2/3) ... [2023-11-06 22:47:12,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3f77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:12, skipping insertion in model container [2023-11-06 22:47:12,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:12" (3/3) ... [2023-11-06 22:47:12,295 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2023-11-06 22:47:12,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:12,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:47:12,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:12,395 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=LoopsAndPotentialCycles, 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;@45a3cff3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:12,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:47:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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-06 22:47:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:47:12,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:12,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:47:12,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:12,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2023-11-06 22:47:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983359841] [2023-11-06 22:47:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:12,449 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-06 22:47:12,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:12,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:12,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:12,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:47:12,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:13,351 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-06 22:47:13,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:13,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983359841] [2023-11-06 22:47:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983359841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:13,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938570684] [2023-11-06 22:47:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:13,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:13,400 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-06 22:47:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:13,529 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2023-11-06 22:47:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2023-11-06 22:47:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:13,539 INFO L225 Difference]: With dead ends: 19 [2023-11-06 22:47:13,539 INFO L226 Difference]: Without dead ends: 10 [2023-11-06 22:47:13,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:13,546 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:13,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:47:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-06 22:47:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-11-06 22:47:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-06 22:47:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-06 22:47:13,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-11-06 22:47:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:13,584 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-06 22:47:13,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-06 22:47:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-06 22:47:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:47:13,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:13,586 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:13,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:47:13,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:13,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:13,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2023-11-06 22:47:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473059533] [2023-11-06 22:47:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:13,814 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-06 22:47:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:13,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:13,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:14,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-06 22:47:14,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:16,521 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-06 22:47:16,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:47:21,920 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-06 22:47:21,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473059533] [2023-11-06 22:47:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473059533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:47:21,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:47:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 22:47:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434443312] [2023-11-06 22:47:21,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:47:21,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:47:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:47:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2023-11-06 22:47:21,925 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-06 22:47:27,471 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (= (bvadd |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (_ bv1 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~msb_SORT_4~0#1| (_ bv2147483648 32)) (= (_ bv500 32) |c_ULTIMATE.start_main_~var_27~0#1|) (or (forall ((|v_ULTIMATE.start_main_~var_99_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_6| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_5| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_5| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_6|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_5|) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_5|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_5|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_6|)))))))))))))))) (_ bv1 32))))))) (_ bv0 8))) (let ((.cse6 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse8 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse5 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse12 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8)))) (let ((.cse1 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8))) (.cse2 (or (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse13 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse5 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse5))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse13) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse14 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse5 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_5|)))))) .cse5))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse14) (_ bv0 32)) (not (= (bvand (bvor .cse6 (bvashr (bvor .cse14 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)))))) .cse12)) (.cse3 (not .cse12))) (and (or .cse1 (and .cse2 (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse4 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse5))) .cse5))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse4) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse4) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_5| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse7 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_5|))))) .cse5))) .cse5))) (_ bv16 32))))) (or (not (= (bvand (bvor .cse6 (bvashr (bvor .cse7 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse7) (_ bv0 32))))))))) (or (not .cse1) (and .cse2 (or .cse3 (let ((.cse10 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse5))) .cse5))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse9 (bvor .cse10 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse6 (bvashr (bvor .cse9 .cse8) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand .cse9 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_5| (_ BitVec 16))) (let ((.cse11 (bvor .cse10 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_5|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse11 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand .cse11 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|))))))))))))))) (let ((.cse15 (exists ((|ULTIMATE.start_main_~var_40_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_40_arg_1~0#1|))) (_ bv1 32))))))) (or (and .cse15 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse16)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|)))))))))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= (_ bv0 8) .cse16)))))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|)) (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16))) (and (exists ((|ULTIMATE.start_main_~var_39_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_39_arg_1~0#1|))))) (_ bv1 32))))) (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse17)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|))))))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= .cse17 (_ bv0 8))))))) (and .cse15 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_9| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_9| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_9|) (_ bv1 32)))) (.cse19 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_9|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse19)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= .cse18 (_ bv0 8))) (not (= (_ bv0 8) .cse19)))))))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) is different from false [2023-11-06 22:47:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:27,751 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-11-06 22:47:27,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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 8 [2023-11-06 22:47:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:27,753 INFO L225 Difference]: With dead ends: 15 [2023-11-06 22:47:27,753 INFO L226 Difference]: Without dead ends: 13 [2023-11-06 22:47:27,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=41, Invalid=92, Unknown=3, NotChecked=20, Total=156 [2023-11-06 22:47:27,756 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:27,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 7 Unchecked, 0.4s Time] [2023-11-06 22:47:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-06 22:47:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-11-06 22:47:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-06 22:47:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-06 22:47:27,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2023-11-06 22:47:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:27,768 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-06 22:47:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-06 22:47:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-06 22:47:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:47:27,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:27,769 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 22:47:27,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:27,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:27,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:27,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2023-11-06 22:47:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722868310] [2023-11-06 22:47:27,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:47:27,988 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-06 22:47:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:27,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:28,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:47:28,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:47:28,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:47:28,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-06 22:47:28,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:42,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:48:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:14,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722868310] [2023-11-06 22:48:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722868310] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:48:14,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:48:14,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-06 22:48:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353353446] [2023-11-06 22:48:14,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:48:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:48:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:48:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=137, Unknown=7, NotChecked=0, Total=182 [2023-11-06 22:48:14,747 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-06 22:48:20,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:48:24,038 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_ULTIMATE.start_main_~var_91_arg_1~0#1_7| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_7| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_7| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_7| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_7| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_7| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_7|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_7|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_7|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_7|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_7|) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_7|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_8|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|)))))))))))))))))))))) (_ bv1 32))))))) (_ bv0 8))) (let ((.cse8 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8))) (.cse4 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse5 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse7 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_30~0#1|)) (.cse6 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|))) (let ((.cse9 (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_7| (_ BitVec 16))) (let ((.cse15 (bvor .cse7 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_7|))) .cse6))) .cse6))) (_ bv16 32))))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse4 (bvashr (bvor .cse15 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse15) (_ bv0 32)))))) (.cse1 (not .cse8)) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_7| (_ BitVec 16))) (let ((.cse14 (bvor .cse7 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_7|))) .cse6))) .cse6))) (_ bv16 32))))) (or (not (= (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse14) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse14) (_ bv0 32))))))) (.cse11 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8)))) (and (or (and (or .cse1 (let ((.cse2 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse6))) .cse6))) (_ bv16 32)) .cse7))) (let ((.cse3 (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse2) (_ bv0 32)))) (and (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse2 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not .cse3)) (or .cse3 (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse4 (bvashr (bvor .cse2 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|))))))) (or .cse8 (and .cse9 .cse10))) (not .cse11)) (or (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_7| (_ BitVec 16))) (let ((.cse12 (bvor .cse7 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_7|))))) .cse6))) .cse6))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse12) (_ bv0 32)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor (bvashr (bvor .cse12 .cse5) |c_ULTIMATE.start_main_~var_32~0#1|) .cse4)) |c_ULTIMATE.start_main_~var_27~0#1|)))))) (or .cse9 .cse8) (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_7| (_ BitVec 16))) (let ((.cse13 (bvor .cse7 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_7|))))) .cse6))) .cse6))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse13 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))))))) (or .cse8 .cse10)) .cse11))))) (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_30~0#1| (_ bv0 16)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (let ((.cse23 (exists ((|ULTIMATE.start_main_~var_40_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_40_arg_1~0#1|))) (_ bv1 32))))))) (or (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse16 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_16|) (_ bv1 32)))) (.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (not (= .cse16 (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse18))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse17))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse16)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse18))))))))) (exists ((|ULTIMATE.start_main_~var_39_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_39_arg_1~0#1|))))) (_ bv1 32)))))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse19 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_16|) (_ bv1 32)))) (.cse20 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_16|)))) (.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (not (= .cse19 (_ bv0 8))) (not (= (_ bv0 8) .cse20)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse21 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse21))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse19)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse20)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse22))))))))) .cse23) (and (exists ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse24))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) (_ bv1 32)))))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse24))))))))) (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse26 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_16|)))) (.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (not (= (_ bv0 8) .cse26)) (= |c_ULTIMATE.start_main_~state_25~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse28))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) (_ bv1 32)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse26)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32)))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse27))))))))) .cse23))) (= (bvadd |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (_ bv1 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~msb_SORT_4~0#1| (_ bv2147483648 32)) (= (_ bv500 32) |c_ULTIMATE.start_main_~var_27~0#1|) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) is different from false [2023-11-06 22:48:31,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:48:33,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:48:50,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:48:52,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:48:54,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:48:56,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:48:58,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:01,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:03,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:05,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:07,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:49:13,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:49:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:13,499 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-11-06 22:49:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:49:13,500 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 11 [2023-11-06 22:49:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:13,500 INFO L225 Difference]: With dead ends: 18 [2023-11-06 22:49:13,501 INFO L226 Difference]: Without dead ends: 16 [2023-11-06 22:49:13,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=81, Invalid=253, Unknown=12, NotChecked=34, Total=380 [2023-11-06 22:49:13,503 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:13,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 13 Unknown, 9 Unchecked, 29.7s Time] [2023-11-06 22:49:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-06 22:49:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2023-11-06 22:49:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-06 22:49:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2023-11-06 22:49:13,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2023-11-06 22:49:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:13,526 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2023-11-06 22:49:13,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-06 22:49:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2023-11-06 22:49:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:49:13,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:13,527 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2023-11-06 22:49:13,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:13,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:49:13,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:13,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 3 times [2023-11-06 22:49:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054840479] [2023-11-06 22:49:13,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:49:13,740 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-06 22:49:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:13,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:49:13,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e2865eb-bc4c-49d9-9546-d92c3d5751cb/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:49:14,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:49:14,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:49:14,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 301 conjunts are in the unsatisfiable core [2023-11-06 22:49:14,646 INFO L285 TraceCheckSpWp]: Computing forward predicates...