./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:08:36,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:08:36,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:08:36,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:08:36,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:08:36,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:08:36,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:08:36,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:08:36,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:08:36,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:08:36,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:08:36,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:08:36,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:08:36,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:08:36,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:08:36,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:08:36,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:08:36,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:08:36,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:08:36,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:08:36,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:08:36,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:08:36,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:08:36,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:08:36,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:08:36,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:08:36,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:08:36,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:08:36,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:08:36,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:08:36,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:08:36,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:08:36,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:36,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:08:36,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:08:36,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:08:36,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:08:36,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:08:36,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:08:36,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:08:36,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:08:36,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:08:36,899 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 [2024-11-08 21:08:37,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:08:37,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:08:37,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:08:37,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:08:37,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:08:37,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:08:38,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:08:38,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:08:38,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:08:38,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e454929d2/a02f49f0719742e28211a4671591329c/FLAG874363964 [2024-11-08 21:08:38,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e454929d2/a02f49f0719742e28211a4671591329c [2024-11-08 21:08:38,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:08:38,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:08:38,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:38,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:08:38,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:08:38,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6072c706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38, skipping insertion in model container [2024-11-08 21:08:38,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:38,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:08:38,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2024-11-08 21:08:38,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:38,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:08:38,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2024-11-08 21:08:38,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:38,992 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:08:38,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38 WrapperNode [2024-11-08 21:08:38,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:38,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:38,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:08:38,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:08:39,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,059 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-11-08 21:08:39,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:39,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:08:39,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:08:39,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:08:39,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:08:39,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:08:39,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:08:39,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:08:39,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:08:39,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (1/1) ... [2024-11-08 21:08:39,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:39,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:39,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:08:39,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:08:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:08:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:08:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:08:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:08:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:08:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:08:39,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:08:39,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:08:39,654 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 21:08:39,654 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:08:39,669 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:08:39,670 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:08:39,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:39 BoogieIcfgContainer [2024-11-08 21:08:39,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:08:39,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:08:39,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:08:39,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:08:39,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:08:38" (1/3) ... [2024-11-08 21:08:39,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da7d4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:39, skipping insertion in model container [2024-11-08 21:08:39,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:38" (2/3) ... [2024-11-08 21:08:39,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da7d4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:39, skipping insertion in model container [2024-11-08 21:08:39,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:39" (3/3) ... [2024-11-08 21:08:39,681 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:08:39,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:08:39,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:08:39,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:08:39,760 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@214c44e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:08:39,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:08:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 73 states have (on average 1.547945205479452) internal successors, (113), 74 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:08:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 21:08:39,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:39,777 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:39,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1539672163, now seen corresponding path program 1 times [2024-11-08 21:08:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396857926] [2024-11-08 21:08:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396857926] [2024-11-08 21:08:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396857926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:08:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751762537] [2024-11-08 21:08:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:40,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:08:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:08:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:08:40,166 INFO L87 Difference]: Start difference. First operand has 99 states, 73 states have (on average 1.547945205479452) internal successors, (113), 74 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:08:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:40,212 INFO L93 Difference]: Finished difference Result 191 states and 335 transitions. [2024-11-08 21:08:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:08:40,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-08 21:08:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:40,237 INFO L225 Difference]: With dead ends: 191 [2024-11-08 21:08:40,237 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 21:08:40,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:08:40,250 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:40,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 21:08:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-08 21:08:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5) internal successors, (105), 70 states have internal predecessors, (105), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:08:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-11-08 21:08:40,290 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 156 [2024-11-08 21:08:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:40,291 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-11-08 21:08:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:08:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-11-08 21:08:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 21:08:40,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:40,297 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:08:40,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 951786525, now seen corresponding path program 1 times [2024-11-08 21:08:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696922629] [2024-11-08 21:08:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696922629] [2024-11-08 21:08:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696922629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:08:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505363162] [2024-11-08 21:08:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:40,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:08:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:08:40,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:40,654 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:40,767 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2024-11-08 21:08:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:08:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-08 21:08:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:40,772 INFO L225 Difference]: With dead ends: 279 [2024-11-08 21:08:40,772 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 21:08:40,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:40,774 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 99 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:40,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 243 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:08:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 21:08:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-08 21:08:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 21:08:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 292 transitions. [2024-11-08 21:08:40,796 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 292 transitions. Word has length 156 [2024-11-08 21:08:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:40,797 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 292 transitions. [2024-11-08 21:08:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 292 transitions. [2024-11-08 21:08:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:08:40,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:40,800 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:40,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:08:40,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:40,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1219592401, now seen corresponding path program 1 times [2024-11-08 21:08:40,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:40,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138566342] [2024-11-08 21:08:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:08:41,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138566342] [2024-11-08 21:08:41,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138566342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:08:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996741143] [2024-11-08 21:08:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:41,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:08:41,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:41,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:08:41,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:08:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:41,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:08:41,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:08:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 21:08:41,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:08:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:08:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996741143] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:08:41,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:08:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2024-11-08 21:08:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841236523] [2024-11-08 21:08:41,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:08:41,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 21:08:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:41,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 21:08:41,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:08:41,980 INFO L87 Difference]: Start difference. First operand 184 states and 292 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-08 21:08:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:43,405 INFO L93 Difference]: Finished difference Result 816 states and 1250 transitions. [2024-11-08 21:08:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 21:08:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 157 [2024-11-08 21:08:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:43,411 INFO L225 Difference]: With dead ends: 816 [2024-11-08 21:08:43,413 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 21:08:43,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1561, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 21:08:43,420 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1024 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:43,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1036 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 21:08:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 21:08:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 514. [2024-11-08 21:08:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 407 states have (on average 1.4471744471744472) internal successors, (589), 412 states have internal predecessors, (589), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 21:08:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 775 transitions. [2024-11-08 21:08:43,488 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 775 transitions. Word has length 157 [2024-11-08 21:08:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 775 transitions. [2024-11-08 21:08:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-08 21:08:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 775 transitions. [2024-11-08 21:08:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 21:08:43,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:43,492 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:43,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:08:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:08:43,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:43,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1992661651, now seen corresponding path program 1 times [2024-11-08 21:08:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:43,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486071016] [2024-11-08 21:08:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 123 proven. 57 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-08 21:08:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486071016] [2024-11-08 21:08:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486071016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:08:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482976348] [2024-11-08 21:08:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:08:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:44,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:08:44,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:08:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:44,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 21:08:44,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:08:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 687 proven. 57 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 21:08:46,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:08:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 123 proven. 66 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-11-08 21:08:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482976348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:08:47,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:08:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 37 [2024-11-08 21:08:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207916160] [2024-11-08 21:08:47,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:08:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-08 21:08:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-08 21:08:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 21:08:47,924 INFO L87 Difference]: Start difference. First operand 514 states and 775 transitions. Second operand has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) [2024-11-08 21:08:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:53,763 INFO L93 Difference]: Finished difference Result 1912 states and 2875 transitions. [2024-11-08 21:08:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-08 21:08:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) Word has length 158 [2024-11-08 21:08:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:53,771 INFO L225 Difference]: With dead ends: 1912 [2024-11-08 21:08:53,771 INFO L226 Difference]: Without dead ends: 1428 [2024-11-08 21:08:53,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3865 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2300, Invalid=9256, Unknown=0, NotChecked=0, Total=11556 [2024-11-08 21:08:53,777 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 2751 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 5136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 4416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:53,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 2792 Invalid, 5136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 4416 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 21:08:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-08 21:08:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 743. [2024-11-08 21:08:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 598 states have internal predecessors, (859), 126 states have call successors, (126), 25 states have call predecessors, (126), 25 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 21:08:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1111 transitions. [2024-11-08 21:08:53,846 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1111 transitions. Word has length 158 [2024-11-08 21:08:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:53,846 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1111 transitions. [2024-11-08 21:08:53,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) [2024-11-08 21:08:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1111 transitions. [2024-11-08 21:08:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 21:08:53,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:53,849 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:53,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:08:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 21:08:54,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:54,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1484657195, now seen corresponding path program 1 times [2024-11-08 21:08:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594711101] [2024-11-08 21:08:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594711101] [2024-11-08 21:08:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594711101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:54,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:08:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455215889] [2024-11-08 21:08:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:08:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:08:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:08:54,208 INFO L87 Difference]: Start difference. First operand 743 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:54,383 INFO L93 Difference]: Finished difference Result 1609 states and 2410 transitions. [2024-11-08 21:08:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:08:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-08 21:08:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:54,388 INFO L225 Difference]: With dead ends: 1609 [2024-11-08 21:08:54,388 INFO L226 Difference]: Without dead ends: 908 [2024-11-08 21:08:54,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:08:54,390 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 92 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:54,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 373 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:08:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-08 21:08:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 902. [2024-11-08 21:08:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 718 states have (on average 1.4428969359331476) internal successors, (1036), 726 states have internal predecessors, (1036), 151 states have call successors, (151), 32 states have call predecessors, (151), 32 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-08 21:08:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1338 transitions. [2024-11-08 21:08:54,438 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1338 transitions. Word has length 158 [2024-11-08 21:08:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1338 transitions. [2024-11-08 21:08:54,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1338 transitions. [2024-11-08 21:08:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 21:08:54,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:54,441 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:08:54,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 676189598, now seen corresponding path program 1 times [2024-11-08 21:08:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085078072] [2024-11-08 21:08:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:08:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085078072] [2024-11-08 21:08:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085078072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:08:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681125731] [2024-11-08 21:08:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:54,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:08:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:54,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:08:54,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:08:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:54,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:08:54,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:08:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:08:54,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:08:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:08:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681125731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:08:55,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:08:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 21:08:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026243533] [2024-11-08 21:08:55,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:08:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:08:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:08:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:08:55,179 INFO L87 Difference]: Start difference. First operand 902 states and 1338 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) [2024-11-08 21:08:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:55,415 INFO L93 Difference]: Finished difference Result 2022 states and 2979 transitions. [2024-11-08 21:08:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:08:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) Word has length 159 [2024-11-08 21:08:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:55,423 INFO L225 Difference]: With dead ends: 2022 [2024-11-08 21:08:55,423 INFO L226 Difference]: Without dead ends: 1162 [2024-11-08 21:08:55,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:08:55,426 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 189 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:55,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 417 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:08:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-08 21:08:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1028. [2024-11-08 21:08:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 831 states have (on average 1.4452466907340553) internal successors, (1201), 839 states have internal predecessors, (1201), 151 states have call successors, (151), 45 states have call predecessors, (151), 45 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-08 21:08:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1503 transitions. [2024-11-08 21:08:55,481 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1503 transitions. Word has length 159 [2024-11-08 21:08:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:55,482 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1503 transitions. [2024-11-08 21:08:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) [2024-11-08 21:08:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1503 transitions. [2024-11-08 21:08:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 21:08:55,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:55,484 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:55,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:08:55,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:08:55,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash 955643848, now seen corresponding path program 1 times [2024-11-08 21:08:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845543600] [2024-11-08 21:08:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845543600] [2024-11-08 21:08:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845543600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:08:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976624983] [2024-11-08 21:08:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:08:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:08:55,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:08:55,845 INFO L87 Difference]: Start difference. First operand 1028 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:56,183 INFO L93 Difference]: Finished difference Result 2385 states and 3510 transitions. [2024-11-08 21:08:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:08:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-11-08 21:08:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:56,191 INFO L225 Difference]: With dead ends: 2385 [2024-11-08 21:08:56,191 INFO L226 Difference]: Without dead ends: 1860 [2024-11-08 21:08:56,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:08:56,195 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 286 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:56,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 513 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:08:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-08 21:08:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1148. [2024-11-08 21:08:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 953 states have (on average 1.4700944386149004) internal successors, (1401), 960 states have internal predecessors, (1401), 149 states have call successors, (149), 45 states have call predecessors, (149), 45 states have return successors, (149), 142 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-08 21:08:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1699 transitions. [2024-11-08 21:08:56,264 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1699 transitions. Word has length 159 [2024-11-08 21:08:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:56,265 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1699 transitions. [2024-11-08 21:08:56,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1699 transitions. [2024-11-08 21:08:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 21:08:56,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:56,267 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:56,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:08:56,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash 137995398, now seen corresponding path program 1 times [2024-11-08 21:08:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658429492] [2024-11-08 21:08:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658429492] [2024-11-08 21:08:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658429492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:08:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279101808] [2024-11-08 21:08:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:56,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:08:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:08:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:56,351 INFO L87 Difference]: Start difference. First operand 1148 states and 1699 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:56,476 INFO L93 Difference]: Finished difference Result 3269 states and 4856 transitions. [2024-11-08 21:08:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:08:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-11-08 21:08:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:56,486 INFO L225 Difference]: With dead ends: 3269 [2024-11-08 21:08:56,486 INFO L226 Difference]: Without dead ends: 2167 [2024-11-08 21:08:56,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:56,490 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 139 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:56,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 293 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-08 21:08:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2165. [2024-11-08 21:08:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 1795 states have (on average 1.4512534818941505) internal successors, (2605), 1808 states have internal predecessors, (2605), 284 states have call successors, (284), 85 states have call predecessors, (284), 85 states have return successors, (284), 271 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-08 21:08:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3173 transitions. [2024-11-08 21:08:56,598 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3173 transitions. Word has length 159 [2024-11-08 21:08:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:56,598 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3173 transitions. [2024-11-08 21:08:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3173 transitions. [2024-11-08 21:08:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 21:08:56,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:56,601 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:56,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:08:56,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1667442936, now seen corresponding path program 1 times [2024-11-08 21:08:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489197259] [2024-11-08 21:08:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489197259] [2024-11-08 21:08:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489197259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:08:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486325406] [2024-11-08 21:08:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:56,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:08:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:08:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:08:56,784 INFO L87 Difference]: Start difference. First operand 2165 states and 3173 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:57,017 INFO L93 Difference]: Finished difference Result 3875 states and 5709 transitions. [2024-11-08 21:08:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:08:57,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-11-08 21:08:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:57,027 INFO L225 Difference]: With dead ends: 3875 [2024-11-08 21:08:57,028 INFO L226 Difference]: Without dead ends: 2525 [2024-11-08 21:08:57,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:08:57,032 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 67 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:57,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 447 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:08:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2024-11-08 21:08:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2182. [2024-11-08 21:08:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1812 states have (on average 1.4530905077262692) internal successors, (2633), 1825 states have internal predecessors, (2633), 284 states have call successors, (284), 85 states have call predecessors, (284), 85 states have return successors, (284), 271 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-08 21:08:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3201 transitions. [2024-11-08 21:08:57,196 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3201 transitions. Word has length 159 [2024-11-08 21:08:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:57,197 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 3201 transitions. [2024-11-08 21:08:57,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3201 transitions. [2024-11-08 21:08:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 21:08:57,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:57,199 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:57,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:08:57,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1747102670, now seen corresponding path program 1 times [2024-11-08 21:08:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962304062] [2024-11-08 21:08:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:08:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:08:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:08:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:08:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:08:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:08:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:08:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:08:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:08:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:08:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:08:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:08:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:08:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:08:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:08:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:08:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:08:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:08:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:08:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962304062] [2024-11-08 21:08:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962304062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:57,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:57,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:08:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317313556] [2024-11-08 21:08:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:57,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:08:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:08:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:08:57,363 INFO L87 Difference]: Start difference. First operand 2182 states and 3201 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:57,509 INFO L93 Difference]: Finished difference Result 4561 states and 6694 transitions. [2024-11-08 21:08:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:08:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2024-11-08 21:08:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:57,520 INFO L225 Difference]: With dead ends: 4561 [2024-11-08 21:08:57,520 INFO L226 Difference]: Without dead ends: 2425 [2024-11-08 21:08:57,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:08:57,525 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 29 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:57,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 432 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2024-11-08 21:08:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2207. [2024-11-08 21:08:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1837 states have (on average 1.4501905280348395) internal successors, (2664), 1850 states have internal predecessors, (2664), 284 states have call successors, (284), 85 states have call predecessors, (284), 85 states have return successors, (284), 271 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-08 21:08:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3232 transitions. [2024-11-08 21:08:57,642 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3232 transitions. Word has length 160 [2024-11-08 21:08:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:57,643 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 3232 transitions. [2024-11-08 21:08:57,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:08:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3232 transitions. [2024-11-08 21:08:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 21:08:57,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:57,645 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:57,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:08:57,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 7832308, now seen corresponding path program 1 times [2024-11-08 21:08:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879784811] [2024-11-08 21:08:57,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:08:57,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:08:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:08:57,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:08:57,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:08:57,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:08:57,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 21:08:57,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:08:57,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:08:57,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:08:57 BoogieIcfgContainer [2024-11-08 21:08:57,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:08:57,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:08:57,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:08:57,884 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:08:57,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:39" (3/4) ... [2024-11-08 21:08:57,887 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:08:57,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:08:57,912 INFO L158 Benchmark]: Toolchain (without parser) took 19267.45ms. Allocated memory was 136.3MB in the beginning and 394.3MB in the end (delta: 257.9MB). Free memory was 63.6MB in the beginning and 353.8MB in the end (delta: -290.3MB). Peak memory consumption was 196.7MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,912 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 136.3MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:08:57,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.10ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 63.3MB in the beginning and 147.2MB in the end (delta: -83.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.76ms. Allocated memory is still 188.7MB. Free memory was 147.2MB in the beginning and 143.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,913 INFO L158 Benchmark]: Boogie Preprocessor took 71.22ms. Allocated memory is still 188.7MB. Free memory was 143.0MB in the beginning and 136.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,913 INFO L158 Benchmark]: RCFGBuilder took 539.41ms. Allocated memory is still 188.7MB. Free memory was 136.7MB in the beginning and 106.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,913 INFO L158 Benchmark]: TraceAbstraction took 18209.86ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 106.3MB in the beginning and 128.8MB in the end (delta: -22.5MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,913 INFO L158 Benchmark]: Witness Printer took 28.38ms. Allocated memory is still 394.3MB. Free memory was 128.8MB in the beginning and 353.8MB in the end (delta: -225.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-08 21:08:57,915 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.57ms. Allocated memory is still 136.3MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.10ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 63.3MB in the beginning and 147.2MB in the end (delta: -83.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.76ms. Allocated memory is still 188.7MB. Free memory was 147.2MB in the beginning and 143.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.22ms. Allocated memory is still 188.7MB. Free memory was 143.0MB in the beginning and 136.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 539.41ms. Allocated memory is still 188.7MB. Free memory was 136.7MB in the beginning and 106.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18209.86ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 106.3MB in the beginning and 128.8MB in the end (delta: -22.5MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. * Witness Printer took 28.38ms. Allocated memory is still 394.3MB. Free memory was 128.8MB in the beginning and 353.8MB in the end (delta: -225.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_32 = 2219578776; [L44] unsigned char var_1_34 = 0; [L45] unsigned char var_1_36 = 5; [L46] unsigned char var_1_41 = 32; [L47] double var_1_42 = 16.125; [L48] double var_1_43 = 256.5; [L49] signed short int var_1_45 = -10; [L50] unsigned char last_1_var_1_1 = 2; [L51] unsigned char last_1_var_1_15 = 1; [L52] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L139] var_1_4 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L140] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L142] var_1_5 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] var_1_6 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_8=32, var_1_9=201/2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_8=32, var_1_9=201/2] [L150] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_9=201/2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_9=201/2] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L155] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L156] var_1_12 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L160] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L160] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L161] var_1_17 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L162] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L163] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L168] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L168] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L169] var_1_32 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L170] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L171] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L172] var_1_42 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L173] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L174] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L190] RET updateVariables() [L191] CALL step() [L56] COND FALSE !(var_1_5 >= var_1_6) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L67] unsigned char stepLocal_1 = var_1_15; [L68] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L69] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L70] COND TRUE var_1_15 && stepLocal_1 [L71] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L76] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L85] COND TRUE var_1_11 == var_1_18 [L86] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L88] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=201/2] [L91] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L94] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L96] var_1_22 = var_1_12 [L97] var_1_23 = var_1_8 [L98] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L99] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L99] EXPR ((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L99] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L99] EXPR ((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=64, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L99] COND FALSE !(var_1_13 < ((((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5))))) [L108] COND TRUE (var_1_5 - var_1_7) <= (~ (var_1_32 - var_1_5)) [L109] var_1_25 = ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L114] COND TRUE var_1_6 >= -25 [L115] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L117] COND TRUE (var_1_12 - var_1_12) >= (var_1_11 * var_1_11) [L118] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L120] COND TRUE (var_1_12 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_11 [L121] var_1_41 = var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L123] COND FALSE !((((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11))) >= (var_1_12 / var_1_42)) || var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L128] EXPR var_1_5 & var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L128] EXPR var_1_13 ^ (var_1_5 & var_1_4) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L128] COND FALSE !(var_1_5 <= (var_1_13 ^ (var_1_5 & var_1_4))) [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=94, var_1_21=31, var_1_22=2219578781, var_1_23=63, var_1_24=127, var_1_25=127, var_1_32=-1, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-129, var_1_5=0, var_1_6=49535, var_1_7=-256, var_1_8=63, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4739 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4676 mSDsluCounter, 6697 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5068 mSDsCounter, 1017 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6759 IncrementalHoareTripleChecker+Invalid, 7776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1017 mSolverCounterUnsat, 1629 mSDtfsCounter, 6759 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1426 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2207occurred in iteration=10, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 2207 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2215 NumberOfCodeBlocks, 2215 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2513 ConstructedInterpolants, 0 QuantifiedInterpolants, 10415 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 15712/16192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:08:57,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:08:59,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:08:59,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:08:59,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:08:59,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:09:00,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:09:00,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:09:00,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:09:00,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:09:00,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:09:00,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:09:00,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:09:00,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:09:00,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:09:00,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:09:00,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:09:00,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:09:00,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:09:00,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:09:00,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:09:00,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:09:00,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:09:00,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:09:00,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:09:00,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:09:00,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:09:00,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:09:00,026 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:09:00,027 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:09:00,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:09:00,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:09:00,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:09:00,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:09:00,027 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 [2024-11-08 21:09:00,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:09:00,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:09:00,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:09:00,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:09:00,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:09:00,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:09:01,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:09:01,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:09:01,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:09:01,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623a3effa/51c2588ca7e54f50b804949ed20ed7f8/FLAG96a4c1fca [2024-11-08 21:09:01,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623a3effa/51c2588ca7e54f50b804949ed20ed7f8 [2024-11-08 21:09:01,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:09:01,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:09:01,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:09:01,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:09:01,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:09:01,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:09:01" (1/1) ... [2024-11-08 21:09:01,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378b8dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:01, skipping insertion in model container [2024-11-08 21:09:01,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:09:01" (1/1) ... [2024-11-08 21:09:01,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:09:02,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2024-11-08 21:09:02,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:09:02,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:09:02,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2024-11-08 21:09:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:09:02,278 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:09:02,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02 WrapperNode [2024-11-08 21:09:02,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:09:02,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:09:02,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:09:02,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:09:02,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,329 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-08 21:09:02,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:09:02,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:09:02,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:09:02,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:09:02,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,382 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:09:02,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:09:02,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:09:02,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:09:02,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:09:02,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (1/1) ... [2024-11-08 21:09:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:09:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:09:02,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:09:02,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:09:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:09:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:09:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:09:02,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:09:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:09:02,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:09:02,584 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:09:02,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:09:23,820 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:09:23,820 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:09:23,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:09:23,834 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:09:23,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:09:23 BoogieIcfgContainer [2024-11-08 21:09:23,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:09:23,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:09:23,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:09:23,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:09:23,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:09:01" (1/3) ... [2024-11-08 21:09:23,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61319c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:09:23, skipping insertion in model container [2024-11-08 21:09:23,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:09:02" (2/3) ... [2024-11-08 21:09:23,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61319c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:09:23, skipping insertion in model container [2024-11-08 21:09:23,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:09:23" (3/3) ... [2024-11-08 21:09:23,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2024-11-08 21:09:23,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:09:23,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:09:23,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:09:23,923 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21a41acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:09:23,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:09:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:09:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 21:09:23,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:09:23,940 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:09:23,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:09:23,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:09:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 762980394, now seen corresponding path program 1 times [2024-11-08 21:09:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:09:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902915990] [2024-11-08 21:09:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:09:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:09:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:09:23,963 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) [2024-11-08 21:09:23,966 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 [2024-11-08 21:09:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:25,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:09:25,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:09:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 21:09:25,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:09:25,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:09:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902915990] [2024-11-08 21:09:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902915990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:09:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:09:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:09:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872153082] [2024-11-08 21:09:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:09:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:09:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:09:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:09:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:09:25,540 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:09:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:09:25,562 INFO L93 Difference]: Finished difference Result 153 states and 273 transitions. [2024-11-08 21:09:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:09:25,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-08 21:09:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:09:25,569 INFO L225 Difference]: With dead ends: 153 [2024-11-08 21:09:25,569 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 21:09:25,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:09:25,574 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:09:25,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:09:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 21:09:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 21:09:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:09:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 120 transitions. [2024-11-08 21:09:25,614 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 120 transitions. Word has length 152 [2024-11-08 21:09:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:09:25,614 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 120 transitions. [2024-11-08 21:09:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:09:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 120 transitions. [2024-11-08 21:09:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 21:09:25,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:09:25,619 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:09:25,651 INFO L552 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)] Ended with exit code 0 [2024-11-08 21:09:25,820 WARN L453 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 [2024-11-08 21:09:25,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:09:25,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:09:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 812820708, now seen corresponding path program 1 times [2024-11-08 21:09:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:09:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669233241] [2024-11-08 21:09:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:09:25,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:09:25,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:09:25,826 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) [2024-11-08 21:09:25,827 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 [2024-11-08 21:09:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:27,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 21:09:27,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:09:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 42 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-11-08 21:09:31,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:09:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:09:35,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:09:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669233241] [2024-11-08 21:09:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669233241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:09:35,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:09:35,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-08 21:09:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378527411] [2024-11-08 21:09:35,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:09:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 21:09:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:09:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 21:09:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:09:35,514 INFO L87 Difference]: Start difference. First operand 76 states and 120 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 21:09:45,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:09:48,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:09:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:09:56,252 INFO L93 Difference]: Finished difference Result 351 states and 535 transitions. [2024-11-08 21:09:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 21:09:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 152 [2024-11-08 21:09:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:09:56,256 INFO L225 Difference]: With dead ends: 351 [2024-11-08 21:09:56,256 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 21:09:56,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 21:09:56,258 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 667 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:09:56,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 621 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-08 21:09:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 21:09:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 265. [2024-11-08 21:09:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 173 states have internal predecessors, (232), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-08 21:09:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2024-11-08 21:09:56,311 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 152 [2024-11-08 21:09:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:09:56,315 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2024-11-08 21:09:56,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 21:09:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2024-11-08 21:09:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 21:09:56,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:09:56,318 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:09:56,354 INFO L552 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)] Ended with exit code 0 [2024-11-08 21:09:56,518 WARN L453 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 [2024-11-08 21:09:56,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:09:56,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:09:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash -208187288, now seen corresponding path program 1 times [2024-11-08 21:09:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:09:56,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674209634] [2024-11-08 21:09:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:09:56,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:09:56,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:09:56,521 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) [2024-11-08 21:09:56,523 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 [2024-11-08 21:09:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:09:57,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:09:57,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:10:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:10:02,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:10:02,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:10:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674209634] [2024-11-08 21:10:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674209634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:02,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:10:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700540769] [2024-11-08 21:10:02,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:02,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:10:02,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:10:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:10:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:10:02,184 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:10:04,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:10:06,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:10:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:06,427 INFO L93 Difference]: Finished difference Result 737 states and 1104 transitions. [2024-11-08 21:10:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:10:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-11-08 21:10:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:06,456 INFO L225 Difference]: With dead ends: 737 [2024-11-08 21:10:06,457 INFO L226 Difference]: Without dead ends: 498 [2024-11-08 21:10:06,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:10:06,459 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:06,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 210 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 21:10:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-08 21:10:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 414. [2024-11-08 21:10:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 270 states have internal predecessors, (356), 129 states have call successors, (129), 15 states have call predecessors, (129), 15 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2024-11-08 21:10:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2024-11-08 21:10:06,501 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 153 [2024-11-08 21:10:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2024-11-08 21:10:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:10:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2024-11-08 21:10:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 21:10:06,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:06,505 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:06,541 INFO L552 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)] Ended with exit code 0