./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.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_floatingpointinfluence_no-floats_file-73.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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:12:50,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:12:50,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:12:50,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:12:50,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:12:50,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:12:50,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:12:50,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:12:50,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:12:50,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:12:50,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:12:50,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:12:50,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:12:50,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:12:50,340 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:12:50,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:12:50,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:12:50,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:12:50,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:12:50,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:12:50,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:12:50,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:12:50,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:12:50,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:12:50,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:12:50,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:12:50,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:12:50,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:12:50,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:12:50,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:12:50,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:12:50,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:12:50,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:12:50,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:12:50,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:12:50,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:12:50,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:12:50,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:12:50,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:12:50,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:12:50,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:12:50,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:12:50,351 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2024-11-08 23:12:50,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:12:50,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:12:50,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:12:50,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:12:50,589 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:12:50,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:12:52,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:12:52,221 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:12:52,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:12:52,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26b983fc/3c1881d3dad043359afccbb5ff2e43a1/FLAGfe59482d5 [2024-11-08 23:12:52,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26b983fc/3c1881d3dad043359afccbb5ff2e43a1 [2024-11-08 23:12:52,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:12:52,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:12:52,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:12:52,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:12:52,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:12:52,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229c14f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52, skipping insertion in model container [2024-11-08 23:12:52,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:12:52,799 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_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-11-08 23:12:52,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:12:52,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:12:52,852 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_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-11-08 23:12:52,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:12:52,893 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:12:52,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52 WrapperNode [2024-11-08 23:12:52,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:12:52,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:12:52,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:12:52,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:12:52,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,932 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-08 23:12:52,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:12:52,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:12:52,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:12:52,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:12:52,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,961 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 23:12:52,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:12:52,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:12:52,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:12:52,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:12:52,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 23:12:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:12:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:12:53,014 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 23:12:53,026 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 23:12:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:12:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:12:53,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:12:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:12:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:12:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:12:53,133 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:12:53,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:12:53,406 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:12:53,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:12:53,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:12:53,416 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:12:53,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:53 BoogieIcfgContainer [2024-11-08 23:12:53,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:12:53,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:12:53,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:12:53,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:12:53,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:12:52" (1/3) ... [2024-11-08 23:12:53,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fae6ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:53, skipping insertion in model container [2024-11-08 23:12:53,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (2/3) ... [2024-11-08 23:12:53,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fae6ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:53, skipping insertion in model container [2024-11-08 23:12:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:53" (3/3) ... [2024-11-08 23:12:53,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:12:53,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:12:53,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:12:53,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:12:53,498 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;@59f2ee63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:12:53,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:12:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:12:53,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:53,512 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:53,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:53,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:53,517 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2024-11-08 23:12:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:53,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702422800] [2024-11-08 23:12:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:53,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:53,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702422800] [2024-11-08 23:12:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702422800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:12:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642990587] [2024-11-08 23:12:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:12:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:12:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:12:53,868 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:12:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:53,890 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-11-08 23:12:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:12:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-08 23:12:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:53,897 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:12:53,897 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 23:12:53,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 23:12:53,902 INFO L432 NwaCegarLoop]: 76 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, 76 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 23:12:53,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:12:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 23:12:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 23:12:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-08 23:12:53,941 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2024-11-08 23:12:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-08 23:12:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:12:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-08 23:12:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:12:53,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:53,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:53,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:12:53,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2024-11-08 23:12:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520458152] [2024-11-08 23:12:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520458152] [2024-11-08 23:12:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520458152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:12:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944072896] [2024-11-08 23:12:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:12:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:12:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:12:54,409 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:54,442 INFO L93 Difference]: Finished difference Result 101 states and 149 transitions. [2024-11-08 23:12:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:12:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-08 23:12:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:54,444 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:12:54,444 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 23:12:54,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 23:12:54,446 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:54,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:12:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 23:12:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 23:12:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-08 23:12:54,454 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2024-11-08 23:12:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:54,456 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-08 23:12:54,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-08 23:12:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:12:54,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:54,461 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:54,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:12:54,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:54,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2024-11-08 23:12:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299628866] [2024-11-08 23:12:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299628866] [2024-11-08 23:12:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299628866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:12:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942399064] [2024-11-08 23:12:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:55,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:12:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:12:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:12:55,637 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:55,825 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2024-11-08 23:12:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:12:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-08 23:12:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:55,827 INFO L225 Difference]: With dead ends: 126 [2024-11-08 23:12:55,827 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:12:55,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:12:55,828 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:55,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:12:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2024-11-08 23:12:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-08 23:12:55,835 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 115 [2024-11-08 23:12:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:55,835 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-08 23:12:55,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-08 23:12:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:12:55,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:55,836 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:55,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:12:55,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:55,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1117785961, now seen corresponding path program 1 times [2024-11-08 23:12:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971224904] [2024-11-08 23:12:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971224904] [2024-11-08 23:12:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971224904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:55,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:55,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:12:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525911587] [2024-11-08 23:12:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:12:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:12:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:12:55,903 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:55,927 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2024-11-08 23:12:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:12:55,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-08 23:12:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:55,929 INFO L225 Difference]: With dead ends: 136 [2024-11-08 23:12:55,929 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 23:12:55,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 23:12:55,930 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:55,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:12:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 23:12:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-11-08 23:12:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2024-11-08 23:12:55,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 116 [2024-11-08 23:12:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:55,935 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2024-11-08 23:12:55,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-11-08 23:12:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:12:55,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:55,937 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:55,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:12:55,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:55,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1175044263, now seen corresponding path program 1 times [2024-11-08 23:12:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131461374] [2024-11-08 23:12:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:55,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131461374] [2024-11-08 23:12:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131461374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:12:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526308234] [2024-11-08 23:12:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:57,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:12:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:12:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:12:57,094 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:57,255 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2024-11-08 23:12:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:12:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-08 23:12:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:57,258 INFO L225 Difference]: With dead ends: 148 [2024-11-08 23:12:57,258 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 23:12:57,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:12:57,259 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 33 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:57,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 399 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 23:12:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2024-11-08 23:12:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2024-11-08 23:12:57,270 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2024-11-08 23:12:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2024-11-08 23:12:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2024-11-08 23:12:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:12:57,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:57,274 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:57,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:12:57,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:57,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -473979685, now seen corresponding path program 1 times [2024-11-08 23:12:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623983204] [2024-11-08 23:12:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:12:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:12:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:12:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:12:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:12:58,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:58,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623983204] [2024-11-08 23:12:58,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623983204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:58,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:12:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534701597] [2024-11-08 23:12:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:12:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:12:58,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:12:58,716 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:58,904 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-11-08 23:12:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:12:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-08 23:12:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:58,905 INFO L225 Difference]: With dead ends: 91 [2024-11-08 23:12:58,905 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 23:12:58,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:12:58,907 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:58,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 296 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 23:12:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2024-11-08 23:12:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:12:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2024-11-08 23:12:58,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2024-11-08 23:12:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2024-11-08 23:12:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:12:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2024-11-08 23:12:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:12:58,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:58,913 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:12:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:12:58,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 331312688, now seen corresponding path program 1 times [2024-11-08 23:12:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048759430] [2024-11-08 23:12:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:58,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:12:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:59,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:12:59,000 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:12:59,001 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:12:59,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:12:59,004 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:12:59,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:12:59,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:12:59 BoogieIcfgContainer [2024-11-08 23:12:59,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:12:59,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:12:59,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:12:59,063 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:12:59,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:53" (3/4) ... [2024-11-08 23:12:59,065 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:12:59,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:12:59,067 INFO L158 Benchmark]: Toolchain (without parser) took 6448.07ms. Allocated memory was 159.4MB in the beginning and 383.8MB in the end (delta: 224.4MB). Free memory was 88.0MB in the beginning and 204.5MB in the end (delta: -116.6MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,067 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:12:59,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.99ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 73.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.79ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 70.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,070 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 66.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,071 INFO L158 Benchmark]: RCFGBuilder took 441.37ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 66.6MB in the beginning and 185.0MB in the end (delta: -118.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,071 INFO L158 Benchmark]: TraceAbstraction took 5643.71ms. Allocated memory was 220.2MB in the beginning and 383.8MB in the end (delta: 163.6MB). Free memory was 183.9MB in the beginning and 204.5MB in the end (delta: -20.6MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2024-11-08 23:12:59,071 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 383.8MB. Free memory is still 204.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:12:59,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.99ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 73.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.79ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 70.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 66.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 441.37ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 66.6MB in the beginning and 185.0MB in the end (delta: -118.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5643.71ms. Allocated memory was 220.2MB in the beginning and 383.8MB in the end (delta: 163.6MB). Free memory was 183.9MB in the beginning and 204.5MB in the end (delta: -20.6MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 383.8MB. Free memory is still 204.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 to_int at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] unsigned char var_1_6 = 1; [L24] signed long int var_1_7 = 0; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] signed long int var_1_12 = 15; [L29] signed long int var_1_13 = 1; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] signed long int var_1_16 = 16; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] signed long int last_1_var_1_12 = 15; VAL [isInitial=0, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L80] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L80] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L83] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L83] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L84] var_1_13 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L86] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L86] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L88] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L95] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L95] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L96] var_1_18 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L97] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L98] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L98] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L48] COND TRUE var_1_19 > var_1_9 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L49] COND TRUE \read(var_1_6) [L50] var_1_12 = (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L69] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((signed long int) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 - var_1_16))) : (var_1_12 == ((signed long int) var_1_16)))) : (var_1_12 == ((signed long int) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 1420 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 977 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 443 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 2191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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 23:12:59,107 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_floatingpointinfluence_no-floats_file-73.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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:13:00,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:13:01,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:13:01,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:13:01,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:13:01,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:13:01,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:13:01,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:13:01,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:13:01,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:13:01,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:13:01,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:13:01,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:13:01,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:13:01,061 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:13:01,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:13:01,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:13:01,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:13:01,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:13:01,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:13:01,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:13:01,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:13:01,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:13:01,064 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:13:01,064 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:13:01,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:13:01,065 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:13:01,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:13:01,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:13:01,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:13:01,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:13:01,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:13:01,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:13:01,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:13:01,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:01,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:13:01,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:13:01,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:13:01,068 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:13:01,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:13:01,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:13:01,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:13:01,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:13:01,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:13:01,072 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2024-11-08 23:13:01,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:13:01,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:13:01,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:13:01,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:13:01,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:13:01,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:13:02,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:13:02,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:13:02,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:13:02,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb4d5bbc/ae6c505336bf4f1da4dd4fd102faeb8e/FLAG1b2010274 [2024-11-08 23:13:03,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb4d5bbc/ae6c505336bf4f1da4dd4fd102faeb8e [2024-11-08 23:13:03,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:13:03,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:13:03,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:03,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:13:03,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:13:03,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f75c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03, skipping insertion in model container [2024-11-08 23:13:03,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:13:03,465 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_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-11-08 23:13:03,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:03,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:13:03,546 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_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-11-08 23:13:03,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:03,581 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:13:03,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03 WrapperNode [2024-11-08 23:13:03,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:03,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:03,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:13:03,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:13:03,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,633 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-08 23:13:03,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:03,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:13:03,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:13:03,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:13:03,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,698 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 23:13:03,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:13:03,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:13:03,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:13:03,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:13:03,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (1/1) ... [2024-11-08 23:13:03,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:03,748 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 23:13:03,754 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 23:13:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:13:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:13:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:13:03,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:13:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:13:03,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:13:03,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:13:03,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:13:04,866 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:13:04,867 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:13:04,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:13:04,876 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:13:04,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:04 BoogieIcfgContainer [2024-11-08 23:13:04,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:13:04,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:13:04,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:13:04,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:13:04,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:13:03" (1/3) ... [2024-11-08 23:13:04,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539dfd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:04, skipping insertion in model container [2024-11-08 23:13:04,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:03" (2/3) ... [2024-11-08 23:13:04,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539dfd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:04, skipping insertion in model container [2024-11-08 23:13:04,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:04" (3/3) ... [2024-11-08 23:13:04,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2024-11-08 23:13:04,894 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:13:04,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:13:04,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:13:04,951 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;@648d6218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:13:04,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:13:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:13:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:13:04,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:04,965 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:04,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:04,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2024-11-08 23:13:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994871333] [2024-11-08 23:13:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:04,985 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 23:13:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:04,991 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 23:13:05,000 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 23:13:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:05,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:13:05,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 23:13:05,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:05,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:13:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994871333] [2024-11-08 23:13:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994871333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:13:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880487714] [2024-11-08 23:13:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:13:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:13:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:13:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:13:05,305 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:13:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:05,329 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-11-08 23:13:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:13:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-08 23:13:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:05,337 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:13:05,337 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 23:13:05,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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 23:13:05,342 INFO L432 NwaCegarLoop]: 76 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, 76 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 23:13:05,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:13:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 23:13:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 23:13:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:13:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-08 23:13:05,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2024-11-08 23:13:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:05,373 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-08 23:13:05,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:13:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-08 23:13:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:13:05,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:05,377 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:05,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:13:05,577 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 23:13:05,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2024-11-08 23:13:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163667434] [2024-11-08 23:13:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:05,580 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 23:13:05,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:05,582 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 23:13:05,583 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 23:13:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:05,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:13:05,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:13:05,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:05,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:13:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163667434] [2024-11-08 23:13:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163667434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:13:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812075479] [2024-11-08 23:13:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:05,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:13:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:13:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:13:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:13:05,821 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:13:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:06,177 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2024-11-08 23:13:06,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:13:06,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-08 23:13:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:06,179 INFO L225 Difference]: With dead ends: 137 [2024-11-08 23:13:06,180 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 23:13:06,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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 23:13:06,181 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:06,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:13:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 23:13:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2024-11-08 23:13:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:13:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-08 23:13:06,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2024-11-08 23:13:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-08 23:13:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:13:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-08 23:13:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:13:06,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:06,194 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:06,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:13:06,395 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 23:13:06,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2024-11-08 23:13:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:06,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487013799] [2024-11-08 23:13:06,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:06,400 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 23:13:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:06,404 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 23:13:06,407 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 23:13:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:13:06,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:13:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:13:06,623 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-08 23:13:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1853139252] [2024-11-08 23:13:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:13:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:13:06,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:13:06,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 23:13:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:06,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:13:06,788 INFO L278 TraceCheckSpWp]: Computing forward predicates...