./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:12:41,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:12:41,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 21:12:41,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:12:41,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:12:41,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:12:41,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:12:41,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:12:41,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:12:41,375 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:12:41,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:12:41,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:12:41,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:12:41,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:12:41,376 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:12:41,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:12:41,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:12:41,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:12:41,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:12:41,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:12:41,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:12:41,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:12:41,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:12:41,379 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:12:41,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:12:41,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:12:41,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:12:41,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:12:41,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:41,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:12:41,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:12:41,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:12:41,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:12:41,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:12:41,382 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:12:41,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:12:41,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:12:41,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:12:41,627 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:12:41,627 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:12:41,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:42,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:12:42,896 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:12:42,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:42,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1040bf86e/72ff61d6866f4998b54392622675bbb3/FLAGfa5136219 [2023-11-22 21:12:42,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1040bf86e/72ff61d6866f4998b54392622675bbb3 [2023-11-22 21:12:42,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:12:42,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:12:42,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:42,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:12:42,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:12:42,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:42" (1/1) ... [2023-11-22 21:12:42,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ec1123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:42, skipping insertion in model container [2023-11-22 21:12:42,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:42" (1/1) ... [2023-11-22 21:12:42,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:12:43,075 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-22 21:12:43,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:43,239 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:12:43,248 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-22 21:12:43,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:43,320 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:12:43,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43 WrapperNode [2023-11-22 21:12:43,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:43,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:43,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:12:43,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:12:43,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,487 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1873 [2023-11-22 21:12:43,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:43,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:12:43,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:12:43,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:12:43,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:12:43,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:12:43,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:12:43,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:12:43,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (1/1) ... [2023-11-22 21:12:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:43,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:12:43,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:12:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:12:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:12:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:12:43,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:12:44,110 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:12:44,116 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:45,271 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:45,335 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:45,335 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:12:45,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:45 BoogieIcfgContainer [2023-11-22 21:12:45,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:45,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:45,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:45,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:45,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:12:42" (1/3) ... [2023-11-22 21:12:45,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d324c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:45, skipping insertion in model container [2023-11-22 21:12:45,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:43" (2/3) ... [2023-11-22 21:12:45,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d324c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:45, skipping insertion in model container [2023-11-22 21:12:45,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:45" (3/3) ... [2023-11-22 21:12:45,345 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:45,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:45,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:45,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:45,417 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56de8924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:45,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 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-22 21:12:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-22 21:12:45,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:45,429 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] [2023-11-22 21:12:45,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:45,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1974890825, now seen corresponding path program 1 times [2023-11-22 21:12:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953620827] [2023-11-22 21:12:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:45,795 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-22 21:12:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953620827] [2023-11-22 21:12:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953620827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:45,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626957517] [2023-11-22 21:12:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:45,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:45,841 INFO L87 Difference]: Start difference. First operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 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) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-22 21:12:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:45,942 INFO L93 Difference]: Finished difference Result 882 states and 1473 transitions. [2023-11-22 21:12:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2023-11-22 21:12:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:45,960 INFO L225 Difference]: With dead ends: 882 [2023-11-22 21:12:45,961 INFO L226 Difference]: Without dead ends: 465 [2023-11-22 21:12:45,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:45,970 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1397 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 844 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.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:45,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 844 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-11-22 21:12:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 446. [2023-11-22 21:12:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.6651685393258426) internal successors, (741), 445 states have internal predecessors, (741), 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-22 21:12:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 741 transitions. [2023-11-22 21:12:46,036 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 741 transitions. Word has length 58 [2023-11-22 21:12:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:46,037 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 741 transitions. [2023-11-22 21:12:46,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-22 21:12:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 741 transitions. [2023-11-22 21:12:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-22 21:12:46,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:46,041 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-22 21:12:46,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:12:46,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:46,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1884258687, now seen corresponding path program 1 times [2023-11-22 21:12:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351328440] [2023-11-22 21:12:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:46,339 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-22 21:12:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351328440] [2023-11-22 21:12:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351328440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630155839] [2023-11-22 21:12:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:46,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:46,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:46,343 INFO L87 Difference]: Start difference. First operand 446 states and 741 transitions. 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-22 21:12:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:46,365 INFO L93 Difference]: Finished difference Result 450 states and 745 transitions. [2023-11-22 21:12:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:46,365 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-22 21:12:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:46,367 INFO L225 Difference]: With dead ends: 450 [2023-11-22 21:12:46,367 INFO L226 Difference]: Without dead ends: 448 [2023-11-22 21:12:46,370 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-22 21:12:46,371 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:46,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2209 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-22 21:12:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2023-11-22 21:12:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.662192393736018) internal successors, (743), 447 states have internal predecessors, (743), 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-22 21:12:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 743 transitions. [2023-11-22 21:12:46,380 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 743 transitions. Word has length 59 [2023-11-22 21:12:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:46,381 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 743 transitions. [2023-11-22 21:12:46,381 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-22 21:12:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 743 transitions. [2023-11-22 21:12:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 21:12:46,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:46,384 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-22 21:12:46,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:12:46,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:46,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1719248149, now seen corresponding path program 1 times [2023-11-22 21:12:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292275771] [2023-11-22 21:12:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:46,506 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-22 21:12:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292275771] [2023-11-22 21:12:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292275771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:46,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917848191] [2023-11-22 21:12:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:46,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:46,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:46,508 INFO L87 Difference]: Start difference. First operand 448 states and 743 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-22 21:12:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:46,558 INFO L93 Difference]: Finished difference Result 868 states and 1439 transitions. [2023-11-22 21:12:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:46,559 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-22 21:12:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:46,561 INFO L225 Difference]: With dead ends: 868 [2023-11-22 21:12:46,561 INFO L226 Difference]: Without dead ends: 451 [2023-11-22 21:12:46,562 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-22 21:12:46,562 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:46,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2207 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-22 21:12:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2023-11-22 21:12:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.6592427616926504) internal successors, (745), 449 states have internal predecessors, (745), 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-22 21:12:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 745 transitions. [2023-11-22 21:12:46,570 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 745 transitions. Word has length 60 [2023-11-22 21:12:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:46,571 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 745 transitions. [2023-11-22 21:12:46,571 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-22 21:12:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 745 transitions. [2023-11-22 21:12:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-22 21:12:46,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:46,572 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-22 21:12:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:12:46,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:46,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1546652955, now seen corresponding path program 1 times [2023-11-22 21:12:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:46,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940171855] [2023-11-22 21:12:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:46,670 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-22 21:12:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:46,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940171855] [2023-11-22 21:12:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940171855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:46,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:46,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022592400] [2023-11-22 21:12:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:46,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:46,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:46,673 INFO L87 Difference]: Start difference. First operand 450 states and 745 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-22 21:12:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:46,707 INFO L93 Difference]: Finished difference Result 1278 states and 2118 transitions. [2023-11-22 21:12:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:46,708 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-22 21:12:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:46,710 INFO L225 Difference]: With dead ends: 1278 [2023-11-22 21:12:46,711 INFO L226 Difference]: Without dead ends: 859 [2023-11-22 21:12:46,711 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-22 21:12:46,712 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 676 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:46,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2365 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-11-22 21:12:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 452. [2023-11-22 21:12:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.6563192904656319) internal successors, (747), 451 states have internal predecessors, (747), 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-22 21:12:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 747 transitions. [2023-11-22 21:12:46,721 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 747 transitions. Word has length 61 [2023-11-22 21:12:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:46,722 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 747 transitions. [2023-11-22 21:12:46,722 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-22 21:12:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 747 transitions. [2023-11-22 21:12:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 21:12:46,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:46,723 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-22 21:12:46,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:12:46,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:46,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1993458821, now seen corresponding path program 1 times [2023-11-22 21:12:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227494958] [2023-11-22 21:12:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:46,865 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-22 21:12:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227494958] [2023-11-22 21:12:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227494958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:46,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:46,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502338723] [2023-11-22 21:12:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:12:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:12:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:46,868 INFO L87 Difference]: Start difference. First operand 452 states and 747 transitions. Second operand has 5 states, 5 states have (on average 12.4) 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-22 21:12:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:47,351 INFO L93 Difference]: Finished difference Result 1292 states and 2137 transitions. [2023-11-22 21:12:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:12:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) 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-22 21:12:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:47,354 INFO L225 Difference]: With dead ends: 1292 [2023-11-22 21:12:47,354 INFO L226 Difference]: Without dead ends: 871 [2023-11-22 21:12:47,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:12:47,355 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 2068 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2068 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:47,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2068 Valid, 1653 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 21:12:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-22 21:12:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 503. [2023-11-22 21:12:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.653386454183267) internal successors, (830), 502 states have internal predecessors, (830), 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-22 21:12:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 830 transitions. [2023-11-22 21:12:47,364 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 830 transitions. Word has length 62 [2023-11-22 21:12:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:47,365 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 830 transitions. [2023-11-22 21:12:47,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) 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-22 21:12:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 830 transitions. [2023-11-22 21:12:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 21:12:47,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:47,365 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-22 21:12:47,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:12:47,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:47,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1908481465, now seen corresponding path program 1 times [2023-11-22 21:12:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997503851] [2023-11-22 21:12:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:47,526 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-22 21:12:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997503851] [2023-11-22 21:12:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997503851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:47,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:12:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538814053] [2023-11-22 21:12:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:47,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:12:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:12:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:47,528 INFO L87 Difference]: Start difference. First operand 503 states and 830 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-22 21:12:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:47,588 INFO L93 Difference]: Finished difference Result 1402 states and 2313 transitions. [2023-11-22 21:12:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:12:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-22 21:12:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:47,591 INFO L225 Difference]: With dead ends: 1402 [2023-11-22 21:12:47,591 INFO L226 Difference]: Without dead ends: 955 [2023-11-22 21:12:47,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:12:47,593 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 2059 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:47,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 2375 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2023-11-22 21:12:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 507. [2023-11-22 21:12:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.6482213438735178) internal successors, (834), 506 states have internal predecessors, (834), 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-22 21:12:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 834 transitions. [2023-11-22 21:12:47,606 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 834 transitions. Word has length 62 [2023-11-22 21:12:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:47,606 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 834 transitions. [2023-11-22 21:12:47,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-22 21:12:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 834 transitions. [2023-11-22 21:12:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 21:12:47,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:47,610 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-22 21:12:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 21:12:47,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:47,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1201586478, now seen corresponding path program 1 times [2023-11-22 21:12:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236189502] [2023-11-22 21:12:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:47,864 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-22 21:12:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236189502] [2023-11-22 21:12:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236189502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:47,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:12:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426611782] [2023-11-22 21:12:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:47,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:12:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:12:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:12:47,866 INFO L87 Difference]: Start difference. First operand 507 states and 834 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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-22 21:12:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:48,055 INFO L93 Difference]: Finished difference Result 1421 states and 2340 transitions. [2023-11-22 21:12:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:12:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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-22 21:12:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:48,058 INFO L225 Difference]: With dead ends: 1421 [2023-11-22 21:12:48,058 INFO L226 Difference]: Without dead ends: 975 [2023-11-22 21:12:48,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:12:48,060 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 2060 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:48,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 2959 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-11-22 21:12:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 511. [2023-11-22 21:12:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6431372549019607) internal successors, (838), 510 states have internal predecessors, (838), 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-22 21:12:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 838 transitions. [2023-11-22 21:12:48,070 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 838 transitions. Word has length 63 [2023-11-22 21:12:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:48,070 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 838 transitions. [2023-11-22 21:12:48,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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-22 21:12:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 838 transitions. [2023-11-22 21:12:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 21:12:48,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:48,070 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-22 21:12:48,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 21:12:48,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:48,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1342135088, now seen corresponding path program 1 times [2023-11-22 21:12:48,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:48,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864632434] [2023-11-22 21:12:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:48,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:48,161 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-22 21:12:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864632434] [2023-11-22 21:12:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864632434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:48,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:48,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161249885] [2023-11-22 21:12:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:48,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:48,163 INFO L87 Difference]: Start difference. First operand 511 states and 838 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 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-22 21:12:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:48,184 INFO L93 Difference]: Finished difference Result 962 states and 1580 transitions. [2023-11-22 21:12:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 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-22 21:12:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:48,186 INFO L225 Difference]: With dead ends: 962 [2023-11-22 21:12:48,186 INFO L226 Difference]: Without dead ends: 511 [2023-11-22 21:12:48,187 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-22 21:12:48,188 INFO L413 NwaCegarLoop]: 769 mSDtfsCounter, 1391 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 855 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.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:48,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 855 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-22 21:12:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-11-22 21:12:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6392156862745098) internal successors, (836), 510 states have internal predecessors, (836), 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-22 21:12:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 836 transitions. [2023-11-22 21:12:48,196 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 836 transitions. Word has length 63 [2023-11-22 21:12:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:48,196 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 836 transitions. [2023-11-22 21:12:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 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-22 21:12:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 836 transitions. [2023-11-22 21:12:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 21:12:48,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:48,200 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-22 21:12:48,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:12:48,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1513329592, now seen corresponding path program 1 times [2023-11-22 21:12:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757097435] [2023-11-22 21:12:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:48,308 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-22 21:12:48,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:48,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757097435] [2023-11-22 21:12:48,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757097435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:48,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:48,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597468077] [2023-11-22 21:12:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:48,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:12:48,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:12:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:48,309 INFO L87 Difference]: Start difference. First operand 511 states and 836 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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-22 21:12:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:48,350 INFO L93 Difference]: Finished difference Result 1350 states and 2217 transitions. [2023-11-22 21:12:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:12:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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-22 21:12:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:48,356 INFO L225 Difference]: With dead ends: 1350 [2023-11-22 21:12:48,356 INFO L226 Difference]: Without dead ends: 893 [2023-11-22 21:12:48,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:12:48,358 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 2782 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:48,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2782 Valid, 2235 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-11-22 21:12:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 506. [2023-11-22 21:12:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.6376237623762375) internal successors, (827), 505 states have internal predecessors, (827), 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-22 21:12:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 827 transitions. [2023-11-22 21:12:48,367 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 827 transitions. Word has length 63 [2023-11-22 21:12:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:48,368 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 827 transitions. [2023-11-22 21:12:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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-22 21:12:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 827 transitions. [2023-11-22 21:12:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-22 21:12:48,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:48,369 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-22 21:12:48,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 21:12:48,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:48,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 770118977, now seen corresponding path program 1 times [2023-11-22 21:12:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883766826] [2023-11-22 21:12:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:48,479 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-22 21:12:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883766826] [2023-11-22 21:12:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883766826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:48,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230892442] [2023-11-22 21:12:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:48,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:48,480 INFO L87 Difference]: Start difference. First operand 506 states and 827 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-22 21:12:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:48,605 INFO L93 Difference]: Finished difference Result 1380 states and 2259 transitions. [2023-11-22 21:12:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-22 21:12:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:48,610 INFO L225 Difference]: With dead ends: 1380 [2023-11-22 21:12:48,610 INFO L226 Difference]: Without dead ends: 937 [2023-11-22 21:12:48,610 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-22 21:12:48,611 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 1376 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:48,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2034 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2023-11-22 21:12:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 509. [2023-11-22 21:12:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.624015748031496) internal successors, (825), 508 states have internal predecessors, (825), 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-22 21:12:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 825 transitions. [2023-11-22 21:12:48,620 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 825 transitions. Word has length 64 [2023-11-22 21:12:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:48,620 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 825 transitions. [2023-11-22 21:12:48,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-22 21:12:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 825 transitions. [2023-11-22 21:12:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-22 21:12:48,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:48,621 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-22 21:12:48,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:12:48,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:48,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 800873730, now seen corresponding path program 1 times [2023-11-22 21:12:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:48,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325330969] [2023-11-22 21:12:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:49,025 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-22 21:12:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:49,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325330969] [2023-11-22 21:12:49,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325330969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:49,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 21:12:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132962956] [2023-11-22 21:12:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 21:12:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 21:12:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:12:49,027 INFO L87 Difference]: Start difference. First operand 509 states and 825 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 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-22 21:12:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:49,644 INFO L93 Difference]: Finished difference Result 2650 states and 4325 transitions. [2023-11-22 21:12:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 21:12:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 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-22 21:12:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:49,651 INFO L225 Difference]: With dead ends: 2650 [2023-11-22 21:12:49,651 INFO L226 Difference]: Without dead ends: 2208 [2023-11-22 21:12:49,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-11-22 21:12:49,666 INFO L413 NwaCegarLoop]: 2057 mSDtfsCounter, 4716 mSDsluCounter, 9640 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 11697 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:49,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 11697 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 21:12:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-22 21:12:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 523. [2023-11-22 21:12:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.6130268199233717) internal successors, (842), 522 states have internal predecessors, (842), 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-22 21:12:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 842 transitions. [2023-11-22 21:12:49,681 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 842 transitions. Word has length 65 [2023-11-22 21:12:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:49,681 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 842 transitions. [2023-11-22 21:12:49,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 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-22 21:12:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 842 transitions. [2023-11-22 21:12:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-22 21:12:49,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:49,682 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-22 21:12:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 21:12:49,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:49,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1223575556, now seen corresponding path program 1 times [2023-11-22 21:12:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261670624] [2023-11-22 21:12:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:49,946 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-22 21:12:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261670624] [2023-11-22 21:12:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261670624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:12:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966465932] [2023-11-22 21:12:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:12:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:12:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:12:49,948 INFO L87 Difference]: Start difference. First operand 523 states and 842 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) 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-22 21:12:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:50,031 INFO L93 Difference]: Finished difference Result 1394 states and 2260 transitions. [2023-11-22 21:12:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:12:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) 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-22 21:12:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:50,034 INFO L225 Difference]: With dead ends: 1394 [2023-11-22 21:12:50,034 INFO L226 Difference]: Without dead ends: 957 [2023-11-22 21:12:50,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:12:50,036 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 2638 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2638 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:50,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2638 Valid, 3859 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2023-11-22 21:12:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 529. [2023-11-22 21:12:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6098484848484849) internal successors, (850), 528 states have internal predecessors, (850), 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-22 21:12:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 850 transitions. [2023-11-22 21:12:50,051 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 850 transitions. Word has length 65 [2023-11-22 21:12:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:50,051 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 850 transitions. [2023-11-22 21:12:50,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) 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-22 21:12:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 850 transitions. [2023-11-22 21:12:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-22 21:12:50,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:50,052 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-22 21:12:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 21:12:50,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:50,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -306144504, now seen corresponding path program 1 times [2023-11-22 21:12:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058590864] [2023-11-22 21:12:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:50,356 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-22 21:12:50,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058590864] [2023-11-22 21:12:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058590864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 21:12:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786569068] [2023-11-22 21:12:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:50,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 21:12:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 21:12:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:12:50,359 INFO L87 Difference]: Start difference. First operand 529 states and 850 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-22 21:12:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:50,562 INFO L93 Difference]: Finished difference Result 1007 states and 1622 transitions. [2023-11-22 21:12:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:12:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-22 21:12:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:50,564 INFO L225 Difference]: With dead ends: 1007 [2023-11-22 21:12:50,565 INFO L226 Difference]: Without dead ends: 552 [2023-11-22 21:12:50,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-22 21:12:50,566 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 1403 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:50,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 2912 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-11-22 21:12:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 543. [2023-11-22 21:12:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.6014760147601477) internal successors, (868), 542 states have internal predecessors, (868), 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-22 21:12:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 868 transitions. [2023-11-22 21:12:50,575 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 868 transitions. Word has length 66 [2023-11-22 21:12:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:50,575 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 868 transitions. [2023-11-22 21:12:50,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-22 21:12:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 868 transitions. [2023-11-22 21:12:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-22 21:12:50,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:50,576 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-22 21:12:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:12:50,576 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:50,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1995088246, now seen corresponding path program 1 times [2023-11-22 21:12:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730132409] [2023-11-22 21:12:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:50,676 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-22 21:12:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730132409] [2023-11-22 21:12:50,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730132409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:50,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:50,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983122431] [2023-11-22 21:12:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:50,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:50,679 INFO L87 Difference]: Start difference. First operand 543 states and 868 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-22 21:12:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:50,748 INFO L93 Difference]: Finished difference Result 1426 states and 2298 transitions. [2023-11-22 21:12:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:50,748 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-22 21:12:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:50,751 INFO L225 Difference]: With dead ends: 1426 [2023-11-22 21:12:50,751 INFO L226 Difference]: Without dead ends: 965 [2023-11-22 21:12:50,751 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-22 21:12:50,752 INFO L413 NwaCegarLoop]: 1340 mSDtfsCounter, 1418 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:50,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 2038 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-11-22 21:12:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 539. [2023-11-22 21:12:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.6022304832713754) internal successors, (862), 538 states have internal predecessors, (862), 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-22 21:12:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 862 transitions. [2023-11-22 21:12:50,762 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 862 transitions. Word has length 66 [2023-11-22 21:12:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:50,762 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 862 transitions. [2023-11-22 21:12:50,762 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-22 21:12:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 862 transitions. [2023-11-22 21:12:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:12:50,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:50,763 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-22 21:12:50,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 21:12:50,763 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:50,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2009424954, now seen corresponding path program 1 times [2023-11-22 21:12:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838674626] [2023-11-22 21:12:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:50,931 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-22 21:12:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838674626] [2023-11-22 21:12:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838674626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:50,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:50,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 21:12:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122440580] [2023-11-22 21:12:50,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:50,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 21:12:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 21:12:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:12:50,933 INFO L87 Difference]: Start difference. First operand 539 states and 862 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-22 21:12:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:51,096 INFO L93 Difference]: Finished difference Result 1862 states and 3012 transitions. [2023-11-22 21:12:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 21:12:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-22 21:12:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:51,100 INFO L225 Difference]: With dead ends: 1862 [2023-11-22 21:12:51,101 INFO L226 Difference]: Without dead ends: 1408 [2023-11-22 21:12:51,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-22 21:12:51,103 INFO L413 NwaCegarLoop]: 1403 mSDtfsCounter, 1394 mSDsluCounter, 7086 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 8489 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:51,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 8489 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-22 21:12:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 547. [2023-11-22 21:12:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5970695970695972) internal successors, (872), 546 states have internal predecessors, (872), 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-22 21:12:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 872 transitions. [2023-11-22 21:12:51,113 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 872 transitions. Word has length 67 [2023-11-22 21:12:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:51,114 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 872 transitions. [2023-11-22 21:12:51,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-22 21:12:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 872 transitions. [2023-11-22 21:12:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:12:51,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:51,115 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-22 21:12:51,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 21:12:51,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:51,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash 697194440, now seen corresponding path program 1 times [2023-11-22 21:12:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011570091] [2023-11-22 21:12:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:51,318 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-22 21:12:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011570091] [2023-11-22 21:12:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011570091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:51,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:12:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372575691] [2023-11-22 21:12:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:12:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:12:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:12:51,322 INFO L87 Difference]: Start difference. First operand 547 states and 872 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:51,423 INFO L93 Difference]: Finished difference Result 1003 states and 1612 transitions. [2023-11-22 21:12:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:12:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:51,425 INFO L225 Difference]: With dead ends: 1003 [2023-11-22 21:12:51,426 INFO L226 Difference]: Without dead ends: 533 [2023-11-22 21:12:51,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:12:51,427 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 713 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2776 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-11-22 21:12:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 529. [2023-11-22 21:12:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6041666666666667) internal successors, (847), 528 states have internal predecessors, (847), 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-22 21:12:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 847 transitions. [2023-11-22 21:12:51,435 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 847 transitions. Word has length 67 [2023-11-22 21:12:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:51,435 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 847 transitions. [2023-11-22 21:12:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 847 transitions. [2023-11-22 21:12:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:12:51,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:51,436 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-22 21:12:51,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 21:12:51,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:51,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 480104008, now seen corresponding path program 1 times [2023-11-22 21:12:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764761803] [2023-11-22 21:12:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:51,549 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-22 21:12:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764761803] [2023-11-22 21:12:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764761803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:51,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151662803] [2023-11-22 21:12:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:51,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:51,551 INFO L87 Difference]: Start difference. First operand 529 states and 847 transitions. Second operand has 4 states, 4 states have (on average 16.75) 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-22 21:12:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:51,595 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2023-11-22 21:12:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) 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-22 21:12:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:51,597 INFO L225 Difference]: With dead ends: 988 [2023-11-22 21:12:51,597 INFO L226 Difference]: Without dead ends: 541 [2023-11-22 21:12:51,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:51,598 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 697 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:51,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1424 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-11-22 21:12:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 531. [2023-11-22 21:12:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 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-22 21:12:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-11-22 21:12:51,606 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-11-22 21:12:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:51,606 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-11-22 21:12:51,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) 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-22 21:12:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-11-22 21:12:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:12:51,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:51,607 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-22 21:12:51,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 21:12:51,607 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:51,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1108243894, now seen corresponding path program 1 times [2023-11-22 21:12:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244472079] [2023-11-22 21:12:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:51,803 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-22 21:12:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244472079] [2023-11-22 21:12:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244472079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:12:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599342043] [2023-11-22 21:12:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:51,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:12:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:12:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:12:51,806 INFO L87 Difference]: Start difference. First operand 531 states and 849 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:52,030 INFO L93 Difference]: Finished difference Result 1404 states and 2265 transitions. [2023-11-22 21:12:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:12:52,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:52,034 INFO L225 Difference]: With dead ends: 1404 [2023-11-22 21:12:52,034 INFO L226 Difference]: Without dead ends: 965 [2023-11-22 21:12:52,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-22 21:12:52,035 INFO L413 NwaCegarLoop]: 1348 mSDtfsCounter, 2027 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5429 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:52,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5429 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:12:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-11-22 21:12:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 531. [2023-11-22 21:12:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 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-22 21:12:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-11-22 21:12:52,047 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-11-22 21:12:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:52,047 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-11-22 21:12:52,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) 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-22 21:12:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-11-22 21:12:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:12:52,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:52,048 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-22 21:12:52,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 21:12:52,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:52,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1695049908, now seen corresponding path program 1 times [2023-11-22 21:12:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352210801] [2023-11-22 21:12:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:12:52,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:12:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:12:52,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:12:52,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:12:52,153 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:12:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 21:12:52,156 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] [2023-11-22 21:12:52,159 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:12:52,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-22 21:12:52,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-22 21:12:52,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-22 21:12:52,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-22 21:12:52,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-22 21:12:52,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-22 21:12:52,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-22 21:12:52,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-22 21:12:52,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-22 21:12:52,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-22 21:12:52,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-22 21:12:52,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-22 21:12:52,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-22 21:12:52,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-22 21:12:52,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated [2023-11-22 21:12:52,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-22 21:12:52,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated [2023-11-22 21:12:52,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated [2023-11-22 21:12:52,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-22 21:12:52,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-22 21:12:52,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated [2023-11-22 21:12:52,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated [2023-11-22 21:12:52,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-22 21:12:52,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-22 21:12:52,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-22 21:12:52,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated [2023-11-22 21:12:52,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated [2023-11-22 21:12:52,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated [2023-11-22 21:12:52,214 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-22 21:12:52,214 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-22 21:12:52,214 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-22 21:12:52,214 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-22 21:12:52,215 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated [2023-11-22 21:12:52,215 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-22 21:12:52,215 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-22 21:12:52,215 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated [2023-11-22 21:12:52,216 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-22 21:12:52,216 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-22 21:12:52,216 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated [2023-11-22 21:12:52,217 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated [2023-11-22 21:12:52,217 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated [2023-11-22 21:12:52,218 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated [2023-11-22 21:12:52,218 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated [2023-11-22 21:12:52,218 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-22 21:12:52,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:12:52 BoogieIcfgContainer [2023-11-22 21:12:52,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:12:52,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:12:52,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:12:52,237 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:12:52,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:45" (3/4) ... [2023-11-22 21:12:52,239 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 21:12:52,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:12:52,241 INFO L158 Benchmark]: Toolchain (without parser) took 9320.46ms. Allocated memory was 153.1MB in the beginning and 566.2MB in the end (delta: 413.1MB). Free memory was 121.9MB in the beginning and 264.5MB in the end (delta: -142.6MB). Peak memory consumption was 271.5MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,241 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 74.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:52,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 94.9MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.83ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 55.9MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,242 INFO L158 Benchmark]: Boogie Preprocessor took 255.01ms. Allocated memory is still 153.1MB. Free memory was 55.9MB in the beginning and 97.7MB in the end (delta: -41.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,242 INFO L158 Benchmark]: RCFGBuilder took 1588.21ms. Allocated memory was 153.1MB in the beginning and 274.7MB in the end (delta: 121.6MB). Free memory was 97.7MB in the beginning and 208.5MB in the end (delta: -110.8MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,242 INFO L158 Benchmark]: TraceAbstraction took 6898.59ms. Allocated memory was 274.7MB in the beginning and 566.2MB in the end (delta: 291.5MB). Free memory was 207.4MB in the beginning and 265.6MB in the end (delta: -58.1MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,245 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 566.2MB. Free memory was 265.6MB in the beginning and 264.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:52,247 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.14ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 74.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 94.9MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.83ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 55.9MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 255.01ms. Allocated memory is still 153.1MB. Free memory was 55.9MB in the beginning and 97.7MB in the end (delta: -41.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1588.21ms. Allocated memory was 153.1MB in the beginning and 274.7MB in the end (delta: 121.6MB). Free memory was 97.7MB in the beginning and 208.5MB in the end (delta: -110.8MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6898.59ms. Allocated memory was 274.7MB in the beginning and 566.2MB in the end (delta: 291.5MB). Free memory was 207.4MB in the beginning and 265.6MB in the end (delta: -58.1MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 566.2MB. Free memory was 265.6MB in the beginning and 264.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 = 17; [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 = 20; [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 [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=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=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [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=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [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=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [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=17, 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=20] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_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=17, 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=20] [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=17, 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=20] [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=17, 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=20] [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=17, 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=20] [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=17, 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=20] [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=17, 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=20] [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=17, 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=18, var_33_arg_1=16, var_5=0, var_79=20] [L109] EXPR (int)var_33_arg_0 >> var_33_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=17, 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=18, var_33_arg_1=16, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [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=17, 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=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [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, 448 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28817 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28817 mSDsluCounter, 58360 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41250 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2242 IncrementalHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 17110 mSDtfsCounter, 2242 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6379 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 3982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-22 21:12:52,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:12:54,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:12:54,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-22 21:12:54,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:12:54,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:12:54,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:12:54,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:12:54,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:12:54,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:12:54,324 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:12:54,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:12:54,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:12:54,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:12:54,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:12:54,325 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:12:54,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:12:54,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:12:54,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:12:54,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:12:54,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:12:54,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:12:54,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 21:12:54,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 21:12:54,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 21:12:54,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:12:54,328 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:12:54,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:12:54,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:12:54,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:12:54,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:12:54,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:54,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:12:54,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:12:54,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:12:54,330 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 21:12:54,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:12:54,331 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 21:12:54,331 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:12:54,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:12:54,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:12:54,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:12:54,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:12:54,587 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:12:54,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:55,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:12:55,878 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:12:55,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:55,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc01031f/d36bba490c414957bb8234bd195b8be0/FLAG1154802ed [2023-11-22 21:12:55,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc01031f/d36bba490c414957bb8234bd195b8be0 [2023-11-22 21:12:55,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:12:55,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:12:55,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:55,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:12:55,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:12:55,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:55" (1/1) ... [2023-11-22 21:12:55,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d8ab90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:55, skipping insertion in model container [2023-11-22 21:12:55,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:55" (1/1) ... [2023-11-22 21:12:55,956 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:12:56,095 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-22 21:12:56,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:56,216 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:12:56,229 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-22 21:12:56,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:56,286 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:12:56,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56 WrapperNode [2023-11-22 21:12:56,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:56,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:56,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:12:56,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:12:56,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,361 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 455 [2023-11-22 21:12:56,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:56,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:12:56,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:12:56,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:12:56,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:12:56,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:12:56,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:12:56,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:12:56,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (1/1) ... [2023-11-22 21:12:56,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:56,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:56,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:12:56,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:12:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:12:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 21:12:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:12:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:12:56,594 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:12:56,596 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:57,008 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:57,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:57,035 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:12:57,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:57 BoogieIcfgContainer [2023-11-22 21:12:57,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:57,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:57,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:57,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:57,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:12:55" (1/3) ... [2023-11-22 21:12:57,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f315f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:57, skipping insertion in model container [2023-11-22 21:12:57,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:56" (2/3) ... [2023-11-22 21:12:57,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f315f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:57, skipping insertion in model container [2023-11-22 21:12:57,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:57" (3/3) ... [2023-11-22 21:12:57,045 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-22 21:12:57,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:57,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:57,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:57,102 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14362ae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:57,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:12:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 21:12:57,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:57,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 21:12:57,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:57,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-11-22 21:12:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757711547] [2023-11-22 21:12:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:57,128 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-22 21:12:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:57,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:12:57,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:12:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:57,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 21:12:57,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:57,658 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-22 21:12:57,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:12:57,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757711547] [2023-11-22 21:12:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757711547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195166076] [2023-11-22 21:12:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:57,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:12:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:57,690 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:12:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:57,779 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-11-22 21:12:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-22 21:12:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:57,787 INFO L225 Difference]: With dead ends: 16 [2023-11-22 21:12:57,787 INFO L226 Difference]: Without dead ends: 9 [2023-11-22 21:12:57,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:12:57,793 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:57,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-22 21:12:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-22 21:12:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:12:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-22 21:12:57,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-22 21:12:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:57,817 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-22 21:12:57,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:12:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-22 21:12:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 21:12:57,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:57,818 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-22 21:12:57,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:12:58,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:58,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-11-22 21:12:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999755556] [2023-11-22 21:12:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:58,027 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-22 21:12:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:58,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:12:58,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:12:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:58,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-22 21:12:58,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:59,460 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-22 21:12:59,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:13:02,170 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse6 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse3 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse11 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8)))) (let ((.cse0 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8))) (.cse1 (not .cse11)) (.cse7 (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse12 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse3))) .cse3))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse12) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse12 |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|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse13 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse3))) .cse3))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse4 (bvashr (bvor .cse13 .cse6) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))))))))) (and (or .cse0 (and (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse3))) .cse3))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse2) (_ bv0 32))) (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|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse5 (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse3))) .cse3))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse4 (bvashr (bvor .cse5 .cse6) |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| .cse5) (_ bv0 32))))))) .cse7)) (or (not .cse0) (and (or .cse1 (let ((.cse9 (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|))))) .cse3))) .cse3))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse8 (bvor .cse9 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse8 |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| .cse8) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse10 (bvor .cse9 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand (bvor .cse4 (bvashr (bvor .cse10 .cse6) |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| .cse10) (_ bv0 32)))))))) .cse7))))) (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (let ((.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ 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) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ 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_13|) ((_ 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 .cse14 ((_ 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) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ 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_86_arg_0~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32)))))))))) is different from false [2023-11-22 21:13:06,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse2 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse4 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse1 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse16 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse5 (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))) (_ bv0 8))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse16)))) (.cse14 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse20 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse20) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse20 |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|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse21 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse2 (bvashr (bvor .cse21 .cse4) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse21) (_ bv0 32))))))) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (and (or (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse0 (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse0) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse0 |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|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse3 (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse2 (bvashr (bvor .cse3 .cse4) |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| .cse3) (_ bv0 32)))))) .cse5 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse6 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|))))) (or (= .cse6 (_ bv0 8)) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ 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_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse6)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) .cse9)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32)))))) (_ bv0 8)))))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|))) (_ bv0 8)))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse8))))) (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|) .cse10)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) .cse9))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32)))))))) (let ((.cse12 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse1 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse1)))))))))) .cse1))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse11 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|) .cse12))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse11) (_ bv0 32)) (not (= (bvand (bvor .cse2 (bvashr (bvor .cse11 .cse4) |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|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse13 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|) .cse12))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))) (not (= (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse13) |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|)))))))) (or .cse14 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse15 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))))) (or (= .cse15 (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ 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_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|) .cse10)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse15)))) .cse7))) .cse16))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|))))))))))))))))))))))))))))) (or .cse14 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse18 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|)))) (.cse19 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) ((_ 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)))) .cse7))) .cse16))))))))))))))))))))))))))))))))))))))) (= .cse18 (_ bv0 8)) (= .cse19 (_ bv0 8)))))))))) is different from false [2023-11-22 21:13:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 21:13:06,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:13:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999755556] [2023-11-22 21:13:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999755556] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:13:06,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:13:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 21:13:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708321658] [2023-11-22 21:13:06,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:13:06,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 21:13:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:13:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 21:13:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2023-11-22 21:13:06,352 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-22 21:13:08,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse2 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse4 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse1 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse16 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse5 (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))) (_ bv0 8))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse16)))) (.cse14 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse26 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse26) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse26 |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|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse27 (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) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse2 (bvashr (bvor .cse27 .cse4) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse27) (_ bv0 32))))))) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|)) (.cse19 (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16)))) (and (or (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse0 (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse0) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse0 |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|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse3 (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) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse1))) .cse1))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse2 (bvashr (bvor .cse3 .cse4) |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| .cse3) (_ bv0 32)))))) .cse5 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse6 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|))))) (or (= .cse6 (_ bv0 8)) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ 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_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse6)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) .cse9)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32)))))) (_ bv0 8)))))) (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (or (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|))) (_ bv0 8)))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse8))))) (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|) .cse10)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) .cse9))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32)))))))) (let ((.cse12 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse1 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse1)))))))))) .cse1))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse11 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|) .cse12))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse11) (_ bv0 32)) (not (= (bvand (bvor .cse2 (bvashr (bvor .cse11 .cse4) |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|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse13 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|) .cse12))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32))) (not (= (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse13) |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|)))))))) (or .cse14 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse15 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))))) (or (= .cse15 (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ 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_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|) .cse10)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse15)))) .cse7))) .cse16))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|))))))))))))))))))))))))))))) (= (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)) (= (_ bv0 8) |c_ULTIMATE.start_main_~state_17~0#1|) (let ((.cse22 (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_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)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ 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_15|) (_ bv1 32))))) (and (not (= .cse18 (_ bv0 8))) (= ((_ 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) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ 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) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18))))))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~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_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|)))) (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)) (|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|)) .cse19) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ 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)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ 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 ((.cse21 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|) (_ bv1 32)))) (.cse20 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|) (_ 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) ((_ 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) |ULTIMATE.start_main_~var_89_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 (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse20))))))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_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) .cse21)))) (_ 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|) (not (= .cse21 (_ bv0 8))) (not (= .cse20 (_ bv0 8)))))) .cse22) (and .cse22 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ 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))) (let ((.cse23 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|) (_ bv1 32))))) (and (not (= .cse23 (_ bv0 8))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ 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) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse23)))) (_ 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_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))))) |c_ULTIMATE.start_main_~state_25~0#1|))))))) (or .cse14 (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse24 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|)))) (.cse25 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_13|) ((_ 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_89_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse24)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse25)))) .cse7))) .cse16))))))))))))))))))))))))))))))))))))))) (= .cse24 (_ bv0 8)) (= .cse25 (_ bv0 8)))))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) .cse19 (= (_ bv17 32) |c_ULTIMATE.start_main_~var_27~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| (_ bv0 8)))))) is different from false [2023-11-22 21:13:15,473 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-22 21:13:16,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-22 21:13:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:16,744 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-22 21:13:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:13:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-22 21:13:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:16,745 INFO L225 Difference]: With dead ends: 14 [2023-11-22 21:13:16,745 INFO L226 Difference]: Without dead ends: 12 [2023-11-22 21:13:16,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=33, Invalid=66, Unknown=3, NotChecked=54, Total=156 [2023-11-22 21:13:16,746 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:16,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 1 Unknown, 19 Unchecked, 4.0s Time] [2023-11-22 21:13:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-22 21:13:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-11-22 21:13:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-22 21:13:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-11-22 21:13:16,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-11-22 21:13:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:16,753 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-11-22 21:13:16,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-22 21:13:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-11-22 21:13:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 21:13:16,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:16,754 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-11-22 21:13:16,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:13:16,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:13:16,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:16,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-11-22 21:13:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:13:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489830797] [2023-11-22 21:13:16,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:13:16,957 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-22 21:13:16,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:13:16,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:13:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:13:17,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:13:17,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:13:17,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-22 21:13:17,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:45,525 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-22 21:13:45,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-11-22 21:13:45,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:13:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489830797] [2023-11-22 21:13:45,529 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 21:13:45,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:13:45,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 21:13:45,730 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2023-11-22 21:13:45,734 INFO L158 Benchmark]: Toolchain (without parser) took 49826.66ms. Allocated memory was 56.6MB in the beginning and 260.0MB in the end (delta: 203.4MB). Free memory was 25.1MB in the beginning and 184.8MB in the end (delta: -159.7MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,735 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:13:45,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.87ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 24.8MB in the beginning and 29.3MB in the end (delta: -4.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.86ms. Allocated memory is still 69.2MB. Free memory was 29.3MB in the beginning and 46.0MB in the end (delta: -16.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,736 INFO L158 Benchmark]: Boogie Preprocessor took 40.34ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 43.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,736 INFO L158 Benchmark]: RCFGBuilder took 632.66ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 31.1MB in the end (delta: 11.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,736 INFO L158 Benchmark]: TraceAbstraction took 48695.80ms. Allocated memory was 69.2MB in the beginning and 260.0MB in the end (delta: 190.8MB). Free memory was 30.3MB in the beginning and 184.8MB in the end (delta: -154.5MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2023-11-22 21:13:45,739 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.16ms. Allocated memory is still 56.6MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.87ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 24.8MB in the beginning and 29.3MB in the end (delta: -4.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.86ms. Allocated memory is still 69.2MB. Free memory was 29.3MB in the beginning and 46.0MB in the end (delta: -16.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.34ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 43.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.66ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 31.1MB in the end (delta: 11.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 48695.80ms. Allocated memory was 69.2MB in the beginning and 260.0MB in the end (delta: 190.8MB). Free memory was 30.3MB in the beginning and 184.8MB in the end (delta: -154.5MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")